Image upsampling by learning pairs of low-resolution dictionaries using a structured subspace model

ABSTRACT

A computational method is disclosed for producing a sequence of high-resolution (HR) images from an input sequence of low-resolution (LR) images. The method uses a structured subspace framework to learn pairs of LR dictionaries from the input LR sequence ‘and’ employ learned pairs of LR dictionaries into estimating HR images. The structured subspace framework itself is based on a pair of specially structured HR basis matrices, wherein a HR basis spans any HR image whose so-called polyphase components (PPCs) are spanned by the corresponding LR dictionary.

FIELD OF THE INVENTION

The invention relates to a computational method for producing a sequence of high-resolution (HR) images from an input sequence of low-resolution (LR) images. More particularly, the method uses a structured subspace framework to learn pairs of LR dictionaries from the input LR sequence ‘and’ employ learned pairs of LR dictionaries into estimating HR images. The structured subspace framework itself is based on a pair of specially structured HR basis matrices, wherein a HR basis spans any HR image whose so-called polyphase components (PPCs) are spanned by the corresponding LR dictionary.

BACKGROUND OF THE INVENTION

This work addresses the problem of multiframe upsampling (also known as super-resolution, upscaling, or de-aliasing) wherein, given as input a sequence of low resolution (LR) images, the desired output is their corresponding high resolution (HR) versions. In such a problem, low pixel density (low pixel count per square area) causes loss of resolution. Applications include all imaging technologies that produce a sequence of images (e.g. a video, MRI scan, satellite images, aerial surveillance, etc.) with pixel count that is lower than desired.

The conventional approach to the solution of this problem is motion estimation (or motion modeling) across the captured images. But accurate modeling of (complex) motion patterns requires high enough pixel density: a hopeless egg and chicken paradox the signal processing community has been trying to solve for many years.

Instead of the motion estimation route, we adopt a ‘signal representation’ approach (also known as the example-based, training-based or dictionary learning-based approach), which we summarize its relevant (previous) results as follows.

Fact 1

In the machine learning and signal processing communities, it has long been established that given a few samples (partial measurements) of an unknown (HR) image, the entire image can be recovered with reasonable accuracy depending on two main factors: 1—The severity of undersampling; and, 2—The existence of an efficient dictionary (basis) that can represent the HR image well with only a few dictionary atoms. In particular, the more undersampled the image, the more efficient the dictionary needs to be to be able to recover the unknown HR image given partial measurements of it (the available reference (LR) image).

OBSTACLE to Fact 1: creation of a dictionary that can efficiently represent an image is a process known in the machine learning community as: dictionary learning or training. However, the efficiency of a dictionary (for representing a particular image) does not only depend on the learning method in use, but it is also highly dependent on the data (images) used to train the dictionary (efficiency of the dictionary is highly dependent on the training set). In particular, the narrower the training set, the more efficient the learned dictionary would be, even regardless of the learning process. A training set is said to be narrow if the training images (also known as example images) belong to a narrow subclass of images (that also include the sought after image).

What this means in practice is that if the goal is to recover the HR version of a license plate, say, given only a LR version of it, then a training set extracted from high quality example license plate images would be far more useful than a training set based on generic images. In short, the more specialized the training set, the better the outcome. On the other hand, using specialized (narrow) training sets of HR images to learn efficient dictionaries would be entirely useless for estimating generic images. For example, if your training set is made up of HR images of license plates, the learned dictionaries would be completely useless for estimating any images other than license plates.

Fact 2

A simple fact of signal processing is that any 2D signal can be decomposed into multiple LR versions of it, the so-called polyphase components (PPCs), via the basic operations of (2D) shifting and subsampling (decimation). Specifically, for a decimation (subsampling) factor of p, an image can be decomposed into p² PPCs. The first PPC is obtained by starting with the first pixel in the first row of the image, and then decimating (vertically and horizontally) by p. Decimating, starting with the second pixel in the first row, we get the second PPC, and so forth. For example, the (p+1)th PPC is obtained by decimating starting with the first pixel in the second row, and the last p²-th PPC is the result of decimating beginning with the p-th pixel in the p-th row of the image. Therefore, a HR image can be trivially reconstructed from its PPCs simply by interlacing them.

Fact 3

A LR sequence of images (e.g. a LR video) can provide a very narrow training set for the PPCs of (the sought after) HR frames. To put it differently, if we have a sequence of LR images, then why not shift our focus from estimating the unknown HR frames, to estimating the (the low-resolution) PPCs (of each HR frame) instead? FIG. 1 easily demonstrates the potential of this idea. In other words, simply by looking at FIG. 1, it becomes evident that a sequence of LR images can easily provide very narrow training sets for the PPCs of HR images, thus circumventing the obstacle mentioned under Fact 1 above.

OBSTACLE 1 to Fact 3: While Fact 3 avoids the obstacle associated with Fact 1, it introduces the MAJOR issue of lack of ‘partial measurements’. To be more specific, even if we have available a very efficient dictionary for representing an (unknown) image, Fact 1 tells us that if NO partial measurements of it exist, then the efficient dictionary is of NO value.

Now, since Fact 3 suggests using a LR sequence to train efficient dictionaries for the PPCs of a HR frame, the signals that need to be estimated in this case are the PPCs themselves (the target images in a solution based on Fact 3 are the PPCs, from which the HR image is trivially reconstructed). However, without partial measurements for each target signal (each PPC), there is no way to go further along the route of Fact 3.

OBSTACLE 2 to Fact 3: Almost all example-based (aka dictionary-based or training-based) upsampling methods use patch-based processing, which simply means that local sub-regions of a HR frame are estimated instead of estimating the entire HR frame as a whole. In a solution scenario that involves Fact 3, patch-based processing would be essential if the scene is dynamic (changing quickly across the captured frames). However, working on small patches would require regularization, which simply means adding useful information to make up for the scarcity of the data (that comes from working on small patches).

Previous ‘Enablers’ of Fact 3

To resolve OBSTACLE 1 under Fact 3, the authors of U.S. Pat. No. 8,665,342 (“[1]” hereafter) (incorporated herein by reference) proposed exploiting relationships between PPCs corresponding to different decimating factors. Their proposed solution entailed an imaging hardware modification. In particular, their solution would work only for optical imaging systems (cameras) where a secondary sensor, with a different sampling rate (different resolution sensor), must be incorporated into the camera such that it would have the same line of sight as that of the primary sensor (by incorporating, for example, a beam splitter so that both sensors ‘see’ the same scene at the same time).

In what follows, we present the basic premise the authors of the '342 patent used as an ‘enabler’ of Fact 3 (the same enabler remains the foundation of the work in U.S. Pat. Nos. 9,538,126; 9,693,012 and 9,781,381. Each of which is incorporated herein by reference) (“[2]” hereafter). Note: We simply do NOT use said premise in our current solution. Indeed, the reason we include this section is only to help the interested reader to gauge how markedly different our current approach is.

In [1], [2], the job of the secondary sensor is to provide the missing ‘partial measurements’ for the target signals of Fact 3 (the PPCs). In particular, each secondary frame (captured by the secondary sensor) is decimated into multiple (even lower resolution) images each of which provides partial measurements for each PPC that need to be estimated. In the following, we provide a quick review of how the relationships between PPCs was exploited by [1] and [2] for image upsampling. FIG. 2 gives an illustration of decomposing the same 12×12 HR image (color-coded for ease of demonstration) into two different sets of PPCs corresponding to different subsampling rates, p and q=p+1. The first (primary) set, shown in FIG. 2 (b), contains 4 (primary) polyphase components (PPPCs), each corresponding to the same (primary) decimation factor of p=2. FIG. 1 (c) shows the second (or secondary) set, which consists of 9 (secondary) polyphase components (SPPCs), each corresponding to the same (secondary) decimation factor of q=3.

Clearly, given either set of PPCs (the PPPCs or the SPPCs), the HR image can be recovered simply by interlacing the PPCs (from either set). Therefore, if we use the LR images (captured by the camera) to create a representative dictionary (of the same low resolution level) for representing the PPPCs, then we can ultimately reconstruct the HR image simply by finding the representations of the PPPCs in terms of said dictionary. However, without knowing any partial measurements for each PPPC, such a scenario would be impossible. Nonetheless, a careful examination of FIG. 2 reveals that, although we do not know any of the PPCs (neither the PPPCs nor the SPPCs), if we know a single SPPC, then we already know a decimated version of each PPPC. For example, suppose we know the middle (5th) SPPC, then we get a decimated version of all 4 PPPCs. Moreover, the locations of these known pixels provided by the (assumed) known SPPC are unique for each PPPC. Hence, if the camera is (additionally) equipped with different (lower) resolution secondary sensor, with a sampling rate that matches the subsampling rate of the SPPCs, then a captured secondary LR frame can play the role of a reference SPPC (a reference secondary LR image) that provides the needed partial measurements for the PPPCs, and the HR sequence can thus be estimated (see [1], [2] for details).

For the case of ‘dynamic scenes’ (OBSTACLE 2 under Fact 3), the work in [2] proposes regularization in the form of the so-called anchors, as well as generative Gaussian models (GGMs), such that working on small patches of a frame, rather than the whole frame at once, becomes possible.

SUMMARY OF THE INVENTION

A Structured Subspace Perspective as a ‘Powerful Enabler’ of Fact 3

To recap, Fact 1 and Fact 2 are well known. Fact 3, while quite obvious (given Fact 1 and Fact 2), needed an enabler to get over obstacles associated with it. Previous enablers came in the form of an imaging hardware modification coupled with regularization (for dynamic scenes).

Spatial resolution is, obviously, a very fundamental aspect of image quality, so much so that when the physical constraints of an imaging system force us to choose between many important features, sufficient pixel density comes on top of the list of priorities, overshadowing other important requirements such as high dynamic range, or high speed imaging, for example. Even in non-optical imaging modalities (where samples are not captured in the spatial domain), the pixel density can be severely limited by the physics of the imaging technology unless other useful features are sacrificed. Take medical imaging for instance. Doctors would not likely accept low resolution images albeit for the sake of a higher density of image ‘slices’ (per organ), lower radiation doses or shorter scanning times.

Said differently, the reason why upsampling can be such a powerful tool is the fact that pixel density can be traded with so many very important imaging qualities (freezing motion blur, reduced noise, reduced crosstalk, higher sensitivity, higher dynamic range, smaller size, cost and complexity of the imaging system, higher frame rate, reduced scanning time, reduced radiation dose, reduced slice thickness, adding angular resolution, and, of course, larger field of view). But pixel density is of such utmost importance that all of the aforementioned imaging aspects are normally sacrificed to satisfy the basic requirement of adequate pixel density, after-all, who wants pixelated images? Upsampling offers the daring solution of turning the table on its head and sacrifice pixels for the sake of other qualities (and then, thereafter, restoring the missing pixels to acceptable quality). Upsampling is therefore a very fundamental problem, and provided there exists a good enough solution, everyone would want a piece of it. A word search of the US patent database for recent patents on upsampling—also known as super-resolution, upscaling, de-aliasing-would find that many big corporations have patents on upsampling/super-resolution solutions.

In the current invention, we entirely forsake the notion of partial measurements for the PPCs (which necessitates a bi-sensor camera setup of [1], [2]). Instead, we adopt a structured subspace perspective, which allows us to relax the condition of the availability (from the onset) of a secondary LR sequence. In particular, the standpoint of beginning the solution with an ‘initial guess’ of a secondary sequence of images is at odds with a designated task of providing ‘the partial measurements’. By contrast, an initial guess of the missing sequence is admissible within the new solution model, as shall become apparent in the remainder of this disclosure.

In particular, the new structured subspace perspective adopted by this invention constitutes a purely algorithmic ‘enabler’ of Fact 3, and it renders previous enablers of Fact 3 obsolete. In other words, the current proposed solution, while based on the (well known) Fact 1, (well known) Fact 2 and (obvious) Fact 3, requires NO hardware modification (no secondary sensor/beam splitter are required) and it does NOT require any regularization for the case of dynamic scenes. Additionally, this would extend the sphere of applications beyond optical imaging systems (such as medical imaging systems, for example, which are non-optical systems).

In this disclosure, we show how the structured subspace perspective can be used to eliminate the (conventionally) basic requirement of ‘partial measurements’. Said differently, estimating a signal (PPCs in the context of Fact 3), without having some partial measurements of it, is quite simply heretofore unknown. By contrast, the structured subspace model we adopt here, completely circumvents the issue of partial measurements (for PPCs) by seeking representations of HR images in terms of specially structured HR bases (instead of seeking representations of PPCs in terms of LR dictionaries as was the case in [1], [2]).

In particular, the HR bases we use are structured such that they span all HR images whose PPCs are spanned by LR dictionaries learned from the available sequence of LR images. In other words, instead of the ‘brute force’ exploitation of the relationships between PPCs corresponding to different subsampling rates (which necessitates a hardware modification, beam splitter etc.), the new structured model herein, in effect, ‘seamlessly’ embeds these relationships, making the essential issue of partial measurements irrelevant, thus capitalizing, without hindrance, on the obvious fact that a sequence of LR images can be used to provide the best (narrowest) training sets for the PPCs of HR images (FIG. 1).

The structured subspace framework is based on estimating the representations of the sought after HR image in terms of a pair of HR bases, each of which is embedding a (different resolution) LR dictionary. Specifically, the structured subspace framework can be summarized with the following equation (which is to be solved whichever—meaningful—way possible) Vα=Wβ where: V is the first HR basis matrix constructed such that it spans any HR image whose PPCs are spanned by the LR dictionary ψ. W is the second HR basis matrix constructed such that it spans any HR image whose PPCs are spanned by another (different resolution) LR dictionary Φ. α is the representation of the HR image in terms of V. β is the representation of the HR image in terms of W.

Imaging applications that can benefit from upsampling using the disclosed technique:

a) Medical imaging. For example, a magnetic resonance imaging (MRI) system cannot produce an MRI sequence with high density of ‘slices’ without sacrificing the spatial resolution per slice. This is akin to how a camera cannot capture very high frame rate videos without sacrificing the resolution per frame (regardless of the price tag). b) Other applications, where upsampling can computationally make up for the need to sacrifice spatial resolution, include high dynamic range imaging, thermal cameras, flash LADAR/LIDAR and light field imaging. c) Situations that require large distance imaging, yet a large field of view (FOV) is desired (avoiding optically zooming in on a small portion of the FOV). Gigapixel cameras (hundreds of sensors housed in a giant camera) are needed for this reason. With reliable upsampling, a frame captured with a resolution of 100 Mega pixels can be blown up to 1.6 Giga pixels, for example. The ability to cover larger field of view (while computationally making up for the loss of resolution) is very useful in remote sensing, surveillance, search and rescue, etc. d) Consumer/commercial applications. Examples include turning a cell phone camera into a very high resolution camera, and upconverting a standard-definition video (SDTV) signal to an ultra-high definition video (UHDTV), to match the resolution of high-definition displays.

BRIEF DESCRIPTION OF THE DRAWINGS

FIG. 1 shows unknown polyphase components (PPCs) of an unknown (HR) frame vs. a set of captured (LR) frames.

FIG. 2 is an illustration of the relationships between PPCs corresponding to two different subsampling rates, p and q=p+1.

FIG. 3 is a Flow chart illustrating a basic solution baseline based on the proposed structured subspace model. Note: dashed boxes/lines indicate initial guess operations (which are performed only once, before starting the iterative solution).

FIG. 4 is a series of LR to HR image upsampling experiment (p=3).

FIG. 5 is a series of LR to HR image upsampling experiment (p=4).

FIG. 6 is a series of sample frames of the primary (available) LR sequence X.

FIG. 7 is a series of sample frames of the initial guess of the HR sequence Û₍₀₎.

FIG. 8 is a series of sample frames of the first estimate of the secondary (different/lower resolution) LR sequence Y₍₁₎.

FIG. 9 is the 31^(st) frame from the primary (originally available) sequence X vs. the 31^(st) frame from the first estimate of the secondary LR sequence Y₍₁₎. The frames are displayed in this figure with their actual relative sizes.

FIG. 10 is frame #31 from the primary sequence X, partitioned in S=r²=16 different patterns. The sub-images within (imaginary) black borders are the LR patches {x^(kl) ^(s) }, where k=31, s=1, . . . , 16, and total number of patches (per pattern s) is 48, i.e. l_(s)=1, . . . , 48.

FIG. 11 shows multiple HR estimates of frame #31, obtained by tiling all estimated HR patches {û₍₁₎ ^(kl) ^(s) }, k=31, s=1, . . . , 16, and l_(s)=1, . . . , 48.

FIG. 12 shows û₍₁₎ ^(k) (the first iteration estimate) displayed against the initial estimate û₍₀₎ ^(k) (k=31), where û₍₁₎ ^(k) is obtained by computing the median of all estimates shown in FIG. 11.

FIG. 13 highlights an estimated HR patch û₍₁₎ ^(kl) ^(s) at k=31, s=4, and l_(s)=20.

FIG. 14 is an illustration of the extraction process of a pair of local LR training sets (needed for computing the HR patch highlighted in FIG. 13).

FIG. 15 is the pair of LR dictionaries Ψ^(kl) ^(s) and Φ_((i)) ^(kl) ^(s) we used to compute the HR estimate û₍₁₎ ^(kl) ^(s) highlighted in FIG. 13.

DETAILED DESCRIPTION OF THE INVENTION

Estimating HR images based on LR dictionaries is a notion that is quite alien to conventional wisdom. Indeed, image upsampling would be an intrinsically simple problem if all it takes to solve it is to “learn” LR dictionaries from a LR sequence, but could it really be that simple? The answer by the authors of [1], [2] (above) was ‘no’, unless the issue of partial measurements for the PPCs is resolved via an imaging hardware modification.

Adding the structured subspace perspective, however, reveals that no imaging hardware modification is necessary, and that the problem can indeed be solved solely by learning LR dictionaries. Before we proceed with solution details, we would like first to list a few assumptions, acronyms, and notational conventions that will be used in describing the details.

-   -   1—Without loss of generality, we assume that the HR image, we         seek to estimate, is square, and with a dimension that is an         integer multiple of pq, where p is the primary decimation factor         (equivalently, p is also the desired upsampling factor), and q         is the secondary decimation factor, with the added assumption         that         q=p+1.  (1)         -   Namely, if we let u denote the HR image, then u is a matrix             of size d×d, where             d=rpq,  (2)         -   and r is a positive integer.     -   2—The acronym PPCs stands for polyphase components. PPCs         associated with the primary decimation factor p are called         primary PPCs or PPPCs for short. SPPCs is the acronym for         secondary PPCs, which are associated with the secondary         decimation factor q.     -   3—An underlined symbol denotes a (column) vector. Underlined         symbols are also used to denote the vector form of matrices. To         elaborate, vec(·) is conventionally used to denote the         vectorization operator, which turns a matrix into its (column)         vector form (by lexicographical reordering of its elements).         Therefore, if symbol A is used to denote a matrix, then A is         shorthand for vec(A).     -   4—The (vector) subspace that contains all (real) vectors (or         signals) with dimension n is denoted by R^(n). For example,         writing u∈R^(d) ² is simply saying that u (the HR image, in         vector form), is in R^(d) ² , and thus has dimension d².         Similarly, R^(m×n) denotes the subspace of all (real) matrices         of size m×n.     -   5—We denote the identity matrix with the letter I. If a         subscript is added, then it signifies the dimension of the         identity matrix. For example, I_(n) is the identity matrix with         dimension n. Also, for an all zero matrix, we use the letter O.     -   6—The transpose of a matrix (or a vector) is always denoted by         adding the superscript ‘*’. For example, if A is a matrix, then         its transpose is denoted by A*.     -   7—A binary matrix A∈R^(m×n) is a matrix whose entries are either         “0” or “1”. A binary matrix A that is tall or square (m≥n), with         each of its columns containing a sole “1” can be encoded         (parameterized) as follows. Let π_(m) ^(A)(k) denote the         row-index of the sole “1” in the k-th column of A, then the set         of all n row-indices π_(m) ^(A)(1:n), completely encodes A (1:n         is shorthand for k=1, 2, . . . , n). Note, if m=n, we drop the         subscript m. For example,

${{\pi_{4}^{A}\left( {1\text{:}3} \right)} = {{\begin{bmatrix} 2 & 3 & 1 \end{bmatrix}\mspace{14mu}{encodes}\mspace{14mu} A} = \begin{bmatrix} 0 & 0 & 1 \\ 1 & 0 & 0 \\ 0 & 1 & 0 \\ 0 & 0 & 0 \end{bmatrix}}},{and}$ ${\pi^{B}\left( {1\text{:}3} \right)} = {{\begin{bmatrix} 3 & 2 & 3 \end{bmatrix}\mspace{14mu}{encodes}\mspace{14mu} B} = {\begin{bmatrix} 0 & 0 & 0 \\ 0 & 1 & 0 \\ 1 & 0 & 1 \end{bmatrix}.}}$

-   -   8—We denote the Kronecker product and the Hadamard         (element-wise) product, using the symbols ⊗ and ⊙, respectively.         Also, the so-called ‘direct sum’ is denoted by ⊗. In particular,         the notation ⊗_(k=1) ^(s)A is exactly equivalent to I_(s)⊗A. In         other words, if A∈R^(m×n), then ⊗_(k=1) ^(s)A is simply a matrix         of size sm×sn that has s ‘replicas’ of A along the main diagonal         (and zeros everywhere else).     -   9—We use the expression mod(a,b) as a shorthand for ‘a modulo         b’. Also, GCD(a,b) is the ‘greatest common divisor of a and b’.     -   10—Finally, if c is a real number, the smallest integer greater         than or equal to c (the ‘ceiling’ of c) is denoted by ┌c┐. On         the other hand, └c┘ denotes the largest integer smaller than or         equal to c (i.e., └c┘ is the ‘floor’ of c).

1. A HR SUBSPACE BASED ON A LR DICTIONARY

Laying the foundation for our proposed structured subspace-based framework begins with asking (and answering) the following question: suppose we have available a LR dictionary that spans the PPCs of the sought after HR image, how do we construct the ‘basis matrix’ of the subspace of all HR images whose PPCs are spanned by said dictionary?

The answer to that question lies in the basic fact that, instead of simply interlacing its PPCs, a HR image, u∈R^(d×d) can alternatively be constructed from its PPCs, by adding up zero-filled and shifted versions of the PPCs. Said differently, the answer to that question begins by analytically expressing the HR image in terms of its PPCs.

Specifically, let {ƒ_(i)}_(i=1) ^(p) ² ∈R^(rq×rq) denote the set of all p² PPPCs of the HR image (corresponding to the primary decimation factor p), then

$\begin{matrix} {{u = {{\sum\limits_{i = 1}^{p^{2}}{{S_{m_{p}{(i)}}\left( {Z_{p}f_{i}Z_{p}^{*}} \right)}S_{n_{p}{(i)}}^{*}}} = {\sum\limits_{i = 1}^{p^{2}}{\left( {S_{m_{p}{(i)}}Z_{p}} \right){f_{i}\left( {Z_{p}^{*}S_{n_{p}{(i)}}^{*}} \right)}}}}},} & (3) \end{matrix}$

where Z_(p)∈R^(d×rq) zero-fills the columns by a factor of p (zero-filling ‘upsamples’ a vector by inserting p−1 zeros between any two elements, and p−1 zeros after the last element), post-multiplying with Z_(p)* zero-fills the rows, S_(m) _(p) _((i))∈R^(d×d) circularly shifts by m_(p)(i) rows down, and post-multiplying by S_(n) _(p) _((i))*∈R^(d×d) circularly shifts by n_(p)(i) columns to the right. Both S_(m) _(p) _((i)) and S_(n) _(p) _((i))* are therefore (cyclic) permutation matrices, where m_(p)(i) and n_(p)(i) are in correspondence with the location of the i-th PPPC ƒ_(i) on the HR grid, and are given by

$\begin{matrix} {{{m_{p}(i)} = {\left\lceil \frac{i}{p} \right\rceil - 1}},{{n_{p}(i)} = {{mod}\ \left( {{i - 1},p} \right)}},} & (4) \end{matrix}$

Using the fact that zero-filling matrices and circular shifting matrices are binary matrices with the property that each column contains a sole “1”, the row-indices of the “1” elements give us a full description of such matrices. In particular, the expression Π_(d) ^(Z) ^(p) (k)=1+(k−1)p, k=1,2, . . . ,rq  (5)

which encodes the zero-filling matrix Z_(p), gives us all we need to know to construct Z_(p). Specifically, equation (5) literally says that Z_(p) is of size d×rq, and that the k-th column has a “1” located at row Π_(d) ^(Z) ^(p) (k).

Similarly, the shifting matrices S_(m) _(p) _((i)) and S_(n) _(p) _((i)) can be expressed as follows (without using the subscript d since S_(m) _(p) _((i)) and S_(n) _(p) _((i)) are square matrices)

$\begin{matrix} {{{\prod^{S_{m_{\beta}{(i)}}}(k)} = {1 + {{mod}\ \left( {{k + {m_{p}(i)} - 1},\ d} \right)}}},{k = 1},2,\ldots\mspace{14mu},{d.}} & (6) \\ {{{\prod^{S_{n_{\beta}{(i)}}}(k)} = {{1 + {{{mod}\ \left( {{k + {n_{p}(i)} - 1},\ d} \right)}.k}} = 1}},2,\ldots\mspace{14mu},{d.}} & (7) \end{matrix}$

Using the fact that the matrix equation B=CAD* can be reshaped into the vector equation vec(B)=(D⊗C)vec(A), we rewrite (3) to express u∈R^(d) ² in terms of {ƒ_(i) }_(i=1) ^(p) ² ∈R^(r) ² ^(q) ² as follows.

$\begin{matrix} {\underset{\_}{u} = {\sum\limits_{i = 1}^{p^{2}}{\left( {\left( {S_{n_{p}{(i)}}Z_{p}} \right) \otimes \left( {S_{m_{p}{(i)}}Z_{p}} \right)} \right){\underset{\_}{f_{i}}.}}}} & (8) \end{matrix}$

By the mixed-product property of the Kronecker product, we have (S _(n) _(p) _((i)) Z _(p))⊗(S _(m) _(p) _((i)) Z _(p))=(S _(n) _(p) _((i)) ⊗S _(m) _(p) _((i)))(Z _(p) ⊗Z _(p)).  (9) Let S _(p) ₂ ^(i) ≙S _(n) _(p) _((i)) ⊗S _(m) _(p) _((i)),  (10) and Z _(p) ₂ ≙Z _(p) ⊗Z _(p).  (11) S_(p) ₂ ^(i)∈R^(d) ² ^(×d) ² therefore represents 2D (circular) shifting, by m_(p)(i) rows down, and by n_(p)(i) columns to the right, and Z_(p) ₂ ∈R^(d) ² ^(×r) ² ^(q) ² represents 2D zero-filling by a factor of p. Note that S_(p) ₂ ^(i) is a permutation matrix, since the Kronecker product of two permutation matrices (S_(m) _(p) _((i)) and S_(n) _(p) _((i))) is a permutation matrix.

Using (8)-(11), we have

$\begin{matrix} {\underset{\_}{u} = {\sum\limits_{i = 1}^{p^{2}}{S_{p^{2}}^{i}Z_{p^{2}}{\underset{\_}{f_{i}}.}}}} & (12) \end{matrix}$

Note that (12) is the vector equation form of the matrix equation (3).

Now, assume we have available a LR (primary) dictionary, Ψ∈R^(r) ² ^(q) ² ^(×M), with M linearly independent atoms as its columns, and that W spans the set of PPPCs, {ƒ _(i)}_(i=1) ^(p) ² , and let {α _(i)}_(i=1) ^(p) ² ∈R^(M) denote the corresponding representations in terms of Ψ, i.e., ƒ _(i)=Ψα _(i) for i=1,2, . . . ,p ².  (13)

Equation (12) can therefore be rewritten as

$\begin{matrix} {\underset{\_}{u} = {\sum\limits_{i = 1}^{p^{2}}{S_{p^{2}}^{i}Z_{p^{2}}\Psi\;{{\underset{\_}{\alpha}}_{i}.}}}} & (14) \end{matrix}$

Rewriting (14) in matrix-vector form, we get

$\begin{matrix} {\underset{\_}{u} = {{\begin{bmatrix} {S_{p^{2}}^{1}Z_{p^{2}}\Psi} & {S_{p^{2}}^{2}Z_{p^{2}}\Psi} & \ldots & {S_{p^{2}}^{p^{2}}Z_{p^{2}}\Psi} \end{bmatrix}\begin{bmatrix} {\underset{\_}{\alpha}}_{1} \\ {\underset{\_}{\alpha}}_{2} \\ \vdots \\ {\underset{\_}{\alpha}}_{p^{2}} \end{bmatrix}}.}} & (15) \end{matrix}$

Or more concisely,

$\begin{matrix} {{\underset{\_}{u} = {V\;\underset{\_}{\alpha}}},} & (16) \\ {with} & \; \\ {{V\overset{\Delta}{=}\begin{bmatrix} {S_{p^{2}}^{1}Z_{p^{2}}\Psi} & {S_{p^{2}}^{2}Z_{p^{2}}\Psi} & \ldots & {S_{p^{2}}^{p^{2}}Z_{p^{2}}\Psi} \end{bmatrix}},} & (17) \\ {and} & \; \\ {\underset{\_}{\alpha}\overset{\Delta}{=}{\begin{bmatrix} {\underset{\_}{\alpha}}_{1} \\ {\underset{\_}{\alpha}}_{2} \\ \vdots \\ {\underset{\_}{\alpha}}_{p^{2}} \end{bmatrix}.}} & (18) \end{matrix}$

Clearly, the matrix V∈R^(d) ² ^(×p) ² ^(M) is the answer to the question we posed at the beginning of this section. In particular, if we pick any vector {acute over (α)}∈R^(p) ² ^(M), then ú=V{acute over (α)} is a HR image with p² PPPCs that correspond to p² linear combinations {α _(i)}_(i=1) ^(p) ² of the M atoms of Ψ, where the coefficients of the linear combinations are stored in {acute over (α)}.

In other words, if we let V denote the subspace of all HR images of dimension d² whose PPPCs are in span(Ψ), then V=span(V).  (19)

Equation (17) gives us two options as to how to construct V. The first (needlessly computationally expensive) option is to construct the matrices, {S_(p) ₂ ^(i)}_(i=1) ^(p) ² and Z_(p) ₂ (using equations (4), (6), (7), (10) and equations (5), (11), respectively) and then perform p² multiplications with Ψ.

The second option is to simply perform the operations of zero-filling and shifting on the atoms of Ψ, without actually using any matrix operators. In other words, V can be constructed from Ψ without using a single floating point arithmetic. For example, the following Matlab code constructs V from Ψ without any calculations

TABLE 1 Matlab code to construct V from Ψ % input: Psi (and r,p,q,M) d = r*p*q; Psi_vec2mat = reshape(Psi,r*q,r*q,M); V = zeros(d*d,p*p*M); zrs = zeros(d,d,M); c = 0; for i = 1:p  for j = 1:p   c = c+1;   atomZshift = zrs;   atomZshift(i:p:end,j:p:end,:) = Psi_vec2mat;   V(:, (c−1)*M+1:c*M) = reshape(atomZshift,d*d,M);  end end % output: V

However, besides allowing for a formal description of V, the matrices {S_(p) ₂ ^(i)}_(i=1) ^(p) ² and Z_(p) ₂ pave the way for useful insights. To elaborate, note first that V can be factored as the product of two matrices as follows. V=[S _(p) ₂ ¹ Z _(p) ₂ S _(p) ₂ ² Z _(p) ₂ . . . S _(p) ₂ ^(p) ² Z _(p) ₂ ](⊕_(i=1) ^(p) ² Ψ).  (20)

If we define P≙[S _(p) ₂ ¹ Z _(p) ₂ S _(p) ₂ ² Z _(p) ₂ . . . S _(p) ₂ ^(p) ² Z _(p) ₂ ],  (21) and V _(Ψ)≙⊕_(i=1) ^(p) ² Ψ,  (22) then V=PV _(Ψ).  (23)

Now, instead of wastefully computing the Kronecker product in (11), it can be verified (using the code (5) and equation (11)) that Z_(p) ₂ is a binary matrix with the following code

$\begin{matrix} {{{\Pi_{d^{2}}^{Z_{p^{2}}}(k)} = {1 + {p\left( {{\left( {\left\lceil \frac{k}{rq} \right\rceil - 1} \right)d} + {{mod}\ \left( {{k - 1},\ {rq}} \right)}} \right)}}},{k = 1},2,\ldots\mspace{14mu},\ {r^{2}{q^{2}.}}} & (24) \end{matrix}$

Similarly, the row-indices encoding the i-th (permutation) matrix, S_(p) ₂ ^(i), are

$\begin{matrix} {{{\Pi^{S_{p^{2}}^{i}}(k)} = {1 + {{mod}\ \left( {{{mod}\ \left( {{{{n_{p}(i)}d} + {m_{p}(i)} + k - 1},d^{2}} \right)},\ d} \right)} + {{mod}\left( {{d\left( {\left\lfloor \frac{k - 1}{d} \right\rfloor + {n_{p}(i)}} \right)}\ ,d^{2}} \right)}}},\mspace{79mu}{k = 1},2,\ldots\mspace{14mu},d^{2}} & (25) \end{matrix}$

Now, let's turn our attention to the matrix P∈R^(d) ² ^(×d) ² , defined in (21). P consists of p² blocks, {S_(p) ₂ ^(i)Z_(p) ₂ }_(i=1) ^(p) ² , and can be encoded given (24) and (25). In particular, knowing the fact that a zero-filling (or ‘upsampling’) matrix acts as a ‘decimation’ matrix when we post-multiply with it, then all post-multiplying S_(p) ₂ ^(i) with Z_(p) ₂ does is simply knock out (p²−1)r²q² columns of S_(p) ₂ ^(i). Said differently, Z_(p) ₂ , conveniently represented by its code (24), tells us which (of the remaining r² q²) columns of S_(p) ₂ ^(i) are stored as the i-th block in P. Using all these facts together, one can deduce the following encoding of P.

$\begin{matrix} {{{{\Pi^{P}(k)} = {1 + {{mod}\ \left( {{{mod}\left( {{{{n_{p}\left( \overset{\_}{i} \right)}d} + {m_{p}\left( \overset{\_}{i} \right)} + \overset{\_}{k} - 1},d^{2}} \right)},d} \right)} + {{mod}\left( {{d\left( {\left\lfloor \frac{\overset{\_}{k} - 1}{d} \right\rfloor + {n_{p}\left( \overset{\_}{i} \right)}} \right)}\ ,d^{2}} \right)}}},\mspace{79mu}{\overset{\_}{k} = {{{mod}\left( {{\ell - 1},d^{2}} \right)} + 1}},\mspace{79mu}{\overset{\_}{i} = \left\lceil \frac{\ell}{d^{2}} \right\rceil},\mspace{79mu}{\ell = {1 + {p\left( {{\left( {\left\lceil \frac{\overset{\overset{\_}{\_}}{k}}{rq} \right\rceil - 1} \right)d} + {{mod}\;\left( {{\overset{\overset{\_}{\_}}{k} - 1},{rq}} \right)}} \right)} + {\left( {\left\lceil \frac{k}{r^{2}q^{2}} \right\rceil - 1} \right)d^{2}}}},\mspace{79mu}{\overset{\overset{\_}{\_}}{k} = {{{mod}\left( {{k - 1},{r^{2}q^{2}}} \right)} + 1}}}\mspace{79mu}{{k = 1},2,\ldots\mspace{14mu},d^{2}}} & (26) \end{matrix}$ where m_(p) and n_(p) are defined in (4).

Equations (22), (23) and (26) offer an alternate formal and efficient description of how to construct V (in lieu of the computationally expensive option of using equations (4)-(7), (10), (11)). In particular, note that V_(Ψ) (defined in (22)) is just a matrix that contains p² replicas of Ψ on its diagonal (no calculations are required to construct V_(Ψ)). Additionally, it can be proven that P is a permutation matrix and therefore V can be constructed simply by shuffling the rows of V_(Ψ) according to Π^(P)(k).

By definition, each column and each row in a permutation matrix must have a single “1” element. In other words, if one can verify that the row-indices Π^(P) (k) are all unique (no repetitions), then P is a permutation matrix. An easier approach to show that P is a permutation matrix, is to use the fact that a matrix A is a permutation matrix iff A is square, binary and orthogonal (A*A=I). Now, since P is square and binary, proving that P* P=I proves that P is a permutation matrix. In other words, in light of the block structure of P, we just need to show that

$\begin{matrix} {{\left( {S_{p^{2}}^{i}Z_{p^{2}}} \right)^{*}S_{p^{2}}^{j}Z_{p^{2}}} = \left\{ \begin{matrix} {I,} & {i = j} \\ {O,} & {i \neq j} \end{matrix} \right.} & (27) \end{matrix}$

The first part is trivial. In particular, S_(p) ₂ ^(i) is a permutation matrix, and therefore its columns are orthonormal. Obviously, deleting columns (by post-multiplying with Z_(p) ₂ ), does not change the fact that the remaining columns are still orthonormal, i.e. (S_(p) ₂ ^(i)Z_(p) ₂ )*S_(p) ₂ ^(i)Z_(p) ₂ =1.

As to the second part, recall that the function of zero-filling and shifting is to perform interlacing of PPCs using the sum in (12), which means that the non-zero elements of zero-filled and shifted PPCs cannot overlap. This implies that (S _(p) ₂ ^(i) Z _(p) ₂ ƒ _(i))⊙(S _(p) ₂ ^(j) Z _(p) ₂ ƒ _(i))= O ⇒(S _(p) ₂ ^(i) Z _(p) ₂ ƒ _(i))*S _(p) ₂ ^(j) Z _(p) ₂ ƒ _(i)=0,   (28) i.e. ƒ _(i)*(Z_(p) ₂ *S_(p) ₂ ^(i)*S_(p) ₂ ^(j)Z_(p) ₂ )ƒ _(i)=0. Now consider the special case where ƒ _(i)=ƒ _(j)=1 for some i≠j, where 1 is an all-one vector. In this case, we have 1*(Z_(p) ₂ *S_(p) ₂ ^(i)*S_(p) ₂ ^(j)Z_(p) ₂ )1=0, i.e. the sum of all elements of the matrix T=Z_(p) ₂ *S_(p) ₂ ^(i)*S_(p) ₂ ^(j)Z_(p) ₂ must be zero, so what does that tell us about T? We know that the product of two permutation matrices is a permutation matrix and therefore S_(p) ₂ ^(i)*S_(p) ₂ ^(j) is a permutation matrix. Also, post-multiplying by Z_(p) ₂ and pre-multiplying by Z_(p) ₂ * only deletes columns and rows, respectively. In particular, the product (S_(p) ₂ ^(i)*S_(p) ₂ ^(j))Z_(p) ₂ removes (p²−1)r²q² columns of the permutation matrix S_(p) ₂ ^(i)*S_(p) ₂ ^(j), which means that (S_(p) ₂ ^(i)*S_(p) ₂ ^(j))Z_(p) ₂ has only r²q² binary rows, each of which containing a single “1”, with the remaining (p²−1)r²q² rows being entirely zero-row vectors. Now, if we delete (p²−1)r²q² rows of S_(p) ₂ ^(i)*S_(p) ₂ ^(j)Z_(p) ₂ , by pre-multiplying with Z_(p) ₂ *, we get T, and thus T can be either a binary matrix or an all zero matrix, depending on which rows are deleted from S_(p) ₂ ^(i)*S_(p) ₂ ^(j)Z_(p) ₂ to get T. However, since the sum of all elements of T must be zero, then T cannot be a binary matrix, which leaves us with only one possibility, i.e. Z_(p) ₂ *S_(p) ₂ ^(i)*S_(p) ₂ ^(j)Z_(p) ₂ =O.

2. THE INTERSECTION SUBSPACE OF A PAIR OF HR SUBSPACES BASED ON A PAIR OF LR DICTIONARIES

Let {g _(i)}_(i=1)∈R^(r) ² ^(p) ² denote the set of all q² SPPCs of the HR image u (corresponding to the secondary decimation factor q), and assume we have available a (secondary) LR dictionary, Φ∈R^(r) ² ^(p) ² ^(×N), with N linearly independent atoms as its columns, and that Φ spans the set of SPPCs, i.e. g _(i)=Φβ _(i) for i=1,2, . . . ,q ²,  (29) where {β _(i)}_(i=1) ^(q) ² ∈R^(N) denote the corresponding representations of {g _(i)}_(i=1) ^(q) ² in terms of Φ.

Also, let W denote the subspace of all HR images of dimension d² whose SPPCs are in span(Φ), and let W∈R^(d) ² ^(×q) ² ^(N) be the basis matrix of W, i.e. W=span(W).  (30)

Following the analysis presented in the previous section, we can construct W from Φ, simply by exchanging p and q. In particular, the following equations define W. W=QW _(Φ),  (31) where W _(Φ)=⊕_(i=1) ^(q) ² Φ,  (32) and Q∈R^(d) ² ^(×d) ² is a permutation matrix with row-indices given by

Π Q ⁡ ( k ) = 1 + mod ⁢ ( mod ⁢ ( n q ⁡ ( i _ ) ⁢ d + m q ⁡ ( i _ ) + k _ - 1 , ⁢ d 2 ) , d ) + mod ⁢ ⁢ ( d ⁡ ( ⌊ k _ - 1 d ⌋ + n q ⁡ ( i _ ) ) ⁢ , d 2 ) , ( 33 ) ⁢ k ¯ = mod ⁡ ( - 1 , ⁢ d 2 ) + 1 , ⁢ ⁢ ι _ = ⌈ d 2 ⌉ , ⁢ ℓ = 1 + q ⁡ ( ( ⌈ k _ _ r ⁢ p ⌉ - 1 ) ⁢ d + mod ⁢ ( k _ _ = - 1 , ⁢ r ⁢ p ) ) + ( ⌈ k r 2 ⁢ p 2 ⌉ - 1 ) ⁢ d 2 , ⁢ ⁢ k _ _ = mod ⁢ ( k - 1 , ⁢ r 2 ⁢ p 2 ) + 1 ⁢ ⁢ ⁢ k = 1 , 2 , … ⁢ , d 2 ⁢ ⁢ ⁢ where ⁢ m q ⁡ ( i _ ) = ⌈ i _ q ⌉ - 1 , ⁢ ⁢ n q ⁡ ( i _ ) = mod ⁢( i _ - 1 , q ) . ( 34 )

Now, similarly to (16), the HR image can be expressed as

$\begin{matrix} {\underset{\_}{u} = {W{\underset{\_}{\beta}.{where}}}} & (35) \\ {\underset{\_}{\beta}\overset{\Delta}{=}\ {\begin{bmatrix} {\underset{\_}{\beta}}^{1} \\ {\underset{\_}{\beta}}^{2} \\ \vdots \\ {\underset{\_}{\beta}}_{q^{2}} \end{bmatrix}.}} & (36) \end{matrix}$

Now we are ready to ask the following question: Could it be possible that V and W are all we need to find u? If the answer is yes, then, effectively, the pair of LR dictionaries Ψ and Φ are all that is required to find the HR image.

To answer that question, we begin by first combining equations (16) and (35) into one equation Vα=Wβ,  (37) which we rewrite as

$\begin{matrix} {{\begin{bmatrix} V & W \end{bmatrix}\begin{bmatrix} \underset{\_}{\alpha} \\ {- \underset{\_}{\beta}} \end{bmatrix}} = {\underset{\_}{O}.}} & (38) \end{matrix}$

Equation (38) suggests that we need to study the nullspace of the augmented matrix [V W]∈R^(d) ² ^(×(p) ² ^(M+q) ² ^(N)). Before we explain, let Z denote the nullspace of [V W], and let Z∈R^((p) ² ^(M+q) ² ^(N)×z) be its basis, where z≙dim(Z), i.e. Z≙null([V W]),  (39) and Z=span(Z),  (40) and assume that the sought after HR image is large enough. Specifically, assume d ² =r ² p ² q ²≥(p ² M+q ² N).  (41)

Now, define U≙V∩W,  (42) and let U denote the basis for the intersection subspace U, i.e. U=span(U).  (43)

Since u∈V and u∈W, then u∈U, which means that if dim(U)=1, then finding U is tantamount to finding (a scaled version of) u. However, thus far, all we know about the dimensionality of the intersection subspace is 1≤dim(U)≤min(p ² M,q ² N),  (44) where the lower bound is due to the fact that u∈U, while the upper bound is due to (42).

Clearly, to gain additional insight, we need to turn our attention to the nullspace. In particular, let Z be partitioned into a column of two matrices, Z_(V)∈R^(p) ² ^(M×z) and Z_(W)∈R^(q) ² ^(N×z), i.e.

$\begin{matrix} {{Z = \begin{bmatrix} Z_{V} \\ Z_{W} \end{bmatrix}},{then}} & (45) \\ {{U = {VZ_{V}}},} & (46) \end{matrix}$

Equivalently, U=WZ _(W).  (47)

Therefore, if V has full rank p²M, or, equivalently, W has full rank q²N, then,

$\begin{matrix} \begin{matrix} {z\overset{\Delta}{=}{{\dim(\mathcal{Z})} = {{{rank}\;(Z)} = {{{rank}\left( Z_{V} \right)} = {{rank}\left( Z_{W} \right)}}}}} \\ {= {{{rank}\;(U)} = {{\dim(\mathcal{U})}.}}} \end{matrix} & (48) \end{matrix}$

To verify that V is full rank, recall equations (22), (23) and that P*P=I, hence V*V=⊕ _(i=1) ^(p) ² (Ψ*Ψ)  (49)

Therefore, rank(V)=rank(V*V)=p²rank(Ψ*Ψ)=p²rank(Ψ)=p²M. Similarly, W*W=⊕ _(i=1) ^(q) ² (Φ*Φ),  (50) and thus rank(W)=q²N.

Now equation (48) says that the dimensionality of the intersection subspace is equal to the nullity of the augmented matrix [V W]. Of course, the nullity of a matrix is simply the multiplicity of its zero singular values, so the question (which we posed before equation (37)) boils down to: what are the necessary and sufficient conditions for [V W] to have no more than 1 zero-singular value?

The first three necessary conditions are obvious and are already satisfied. Namely, we obviously need the augmented matrix to have more rows than columns (41). Also, the columns of V must be linearly independent (rank(V)=p²M). Similarly, the columns of W must be linearly independent as well (rank(W)=q²N).

The fourth necessary condition is also obvious and it pertains to the span of each of the pair of LR dictionaries Ψ and Φ. In particular, let {{tilde over (ƒ)} _(i)}_(i=1) ^(p) ² and {{tilde over (g)} _(i)}_(i=1) ^(q) ² denote the two sets of PPPCs and SPPCs, respectively, of a different HR image ũ≠cu, c∈R (namely, ũ is a different image and it is not simply a scaled version of u). If {{tilde over (ƒ)} _(i)}_(i=1) ^(p) ² ∈span(Ψ), then we know that ũ∈V. If, additionally, {{tilde over (g)} _(i)}_(i=1) ^(q) ² ∈span(Φ), then ũ∈W, and therefore, ũ∈W. But we already know that u ∈U, and therefore, in this case, dim(U)≥2. In other words, the fourth necessary condition necessitates that the pair of LR dictionaries cannot, simultaneously, accommodate the PPCs of any HR image other than u.

Are there any more conditions? Ostensibly, the answer would require the daunting task of examining the very sparse structure of both V and W; particularly the interaction of both sparse structures within the augmented matrix [V W]. Instead, we derive equivalent forms of (38) to see if the associated matrices are more revealing.

We proceed with the pre-multiplication of both sides of (38) with [V W]*, to obtain

$\begin{matrix} {{\begin{bmatrix} {V^{*}V} & {V^{*}W} \\ {W^{*}V} & {W^{*}W} \end{bmatrix}\;\begin{bmatrix} \underset{\_}{\alpha} \\ {- \underset{\_}{\beta}} \end{bmatrix}} = {\underset{\_}{O}.}} & (51) \end{matrix}$

For convenience, and without loss of generality, we assume that atoms of a LR dictionary are orthonormal, i.e. Ψ*Ψ=I,  (52) and Φ*Φ=I.  (53)

Using (49) and (52) we get V*V=I,  (54)

Similarly (50), (53), W*W=I.  (55)

Consequently, equation (51) is rewritten as

$\begin{matrix} {{\begin{bmatrix} I & {V^{*}W} \\ {W^{*}V} & I \end{bmatrix}\begin{bmatrix} \underset{\_}{\alpha} \\ {- \underset{\_}{\beta}} \end{bmatrix}} = {\underset{\_}{O}.}} & (56) \end{matrix}$

Now the top part of (56) gives us the equation α=V*Wβ,  (57) and the bottom part reveals that β=W*Vα.  (58)

Plugging (58) in (57), we get (I−V*WW*V)α= O.  (59)

Note that V*WW*V=(W*V)*W*V, and therefore, V*WW*V is a symmetric positive semidefinite (PSD) matrix with singular values between 0 and 1 (the upper limit on the largest singular value is due to (54) and (55)). Likewise, the matrix (I−V*WW*V) is also symmetric, PSD, with singular values between 0 and 1. Moreover, since (59) is derived from (51), which in turn is derived from (38), then Z_(V)=null(I−V*WW*V). In other words, dim(U) is equal to the multiplicity of the smallest (“0”) singular value of (I−V*WW*V). Equivalently, dim(U) is equal to the multiplicity of largest (“1”) singular value of V*WW*V, which is the same multiplicity of the largest singular value of W*V, i.e. dim(U)=multiplicity of σ₁(W*V),  (60) where σ₁(·) denotes the largest singular value of a matrix.

So let's take a look at the structure of W*V and see if it could reveal anything about the multiplicity of its singular values (particularly, the largest one). Given equations (22), (23) and equations (31), (32) we can write W*V=(⊕_(j=1) ^(q) ² Φ*)Q*P(⊕_(j=1) ^(p) ² Ψ).  (61)

If we only consider the product (⊕_(j=1) ^(q) ² Φ*)(⊕_(j=1) ^(p) ² Ψ), then it can be proven (with relative ease) that GCD(p,q)=1 is a necessary condition for the largest singular value to be distinct. Unfortunately, the presence of the permutation matrix Q*P in the middle between (⊕_(j=1) ^(q) ² Φ*) and (⊕_(j=1) ^(p) ² Ψ) complicates the picture. Yet, the same necessary condition can still be observed to hold for σ_(i)(W*V) to be distinct.

For practical reasons that shall become apparent later, we are only interested in the case q=p+1, which automatically satisfies GCD(p,q)=1. Said differently, we are only interested in what the structure of W*V can reveal about the multiplicity of σ_(i) (W*V) given the assumption (1). Before we proceed, let us first make the following definitions.

Let A_(j) ^(i)∈R^(r) ² ^(×M) and B_(j) ^(i)∈R^(r) ² ^(×N) denote submatrices of Ψ, and Φ, respectively, such that A _(j) ^(i) =D _(q) ₂ R _(k) _(q) _((i),k) _(q) _((j))Ψ,  (62) where D_(q) ₂ ∈R^(r) ² ^(×r) ² ^(q) ² represents 2D decimation by a factor of q, and R_(k) _(q) _((i),k) _(q) _((j))∈R^(r) ² ^(q) ² ^(×r) ² ^(q) ² represents 2D shifting by k_(g)(i) rows up, and k_(g)(j) columns to the left, where k _(g)(i)=mod(q−i,q).  (63)

Said differently, if we obtain the 2D form of each atom (column) in W, and decimate (by q) each (2D) atom starting at the entry located in column k_(g)(j)+1 and row k_(g)(i)+1, and then vectorize the decimated atoms and stack them next to each other, we get

Similarly, B _(j) ^(i) =D _(p) ₂ R _(k) _(p) _((i),k) _(p) _((j))Φ,  (64) where D_(p) ₂ ∈R^(r) ² ^(×q) ² ^(×r) ² ^(q) ² represents 2D decimation by a factor of p, and R_(k) _(p) _((i),k) _(p) _((j))∈R^(r) ² ^(p) ² ^(×r) ² ^(p) ² represents 2D shifting by k_(p)(i) rows up, and k_(p)(j) columns to the left, where k _(p)(i)=mod(p−i,p).  (65)

Now, it can be verified that when (1) is satisfied, W*V∈R^(q) ² ^(N×p) ² ^(M) block-Toeplitz matrix, i.e.

$\begin{matrix} {{{W^{*}V} = \begin{bmatrix} T_{0} & T_{- 1} & T_{- 2} & \ldots & T_{1 - p} \\ T_{1} & T_{0} & T_{- 1} & \ldots & T_{2 - p} \\ T_{2} & T_{1} & T_{0} & \ldots & T_{3 - p} \\ \vdots & \vdots & \vdots & \ddots & \vdots \\ T_{q - 1} & T_{q - 2} & T_{q - 3} & \ldots & T_{0} \end{bmatrix}},} & (66) \end{matrix}$ with each block T_(i)∈R^(qN×pM),1−p≤i≤q−1, being a q×p block-Toeplitz matrix itself,

$\begin{matrix} {{T_{i} = \begin{bmatrix} C_{0}^{i} & C_{- 1}^{i} & C_{- 2}^{i} & \ldots & C_{1 - p}^{i} \\ C_{1}^{i} & C_{0}^{i} & C_{- 1}^{i} & \ldots & C_{2 - p}^{i} \\ C_{2}^{i} & C_{1}^{i} & C_{0}^{i} & \ldots & C_{3 - p}^{i} \\ \vdots & \vdots & \vdots & \ddots & \vdots \\ C_{q - 1}^{i} & C_{q - 2}^{i} & C_{q - 3}^{i} & \ldots & C_{0}^{i} \end{bmatrix}},} & (67) \end{matrix}$ where the j-th sub-block C_(j) ^(i)∈R^(N×M),1−p≤j≤q−1, is given by C _(j) ^(i) =B _(j) ^(i) *A _(j) ^(i),  (68) and A_(j) ^(i) and B_(j) ^(i) are as defined in (62)-(65).

In other words, when (1) is satisfied it can be verified that W*V is a Toeplitz-block-Toeplitz (a 2-level Toeplitz) matrix generated by the (p+q−1)²=4p² sub-blocks {C_(j) ^(i)}_(i,j=1−p) ^(q−1) as detailed by equations (62)-(68). Moreover, equations (62)-(65), and (68) tell us that all these sub-blocks are unique (i.e. C_(j) ^(i)≠C _(j) ^(ī) if either ī≠i or j≠j).

So now, instead of wondering about other conditions we might need for the (sparse) augmented matrix of (38) to have a nullity of exactly 1, the question becomes: given that q=p+1, are the aforementioned necessary conditions all we need for the (dense) Toeplitz-block-Toeplitz matrix W*V to have a distinct largest singular value?

The relevant literature is rich with analysis and properties pertaining to Toeplitz matrices. However, to the best of our knowledge, when it comes to the question of the multiplicity of singular values of Toeplitz-structured matrices, the answer can only be given in the context of asymptotic distributions of singular values (and under assumptions that do not apply in our case). Therefore, we state the following empirically verifiable result.

Empirical Result 1: Given that the basic assumption (1) is satisfied, i.e. q=p+1, the following conditions are both necessary and sufficient for σ_(i) (W*V) to be distinct.

${\text{1-}\mspace{14mu} r} \geq {\left\lceil \frac{\sqrt{\left( {{p^{2}M} + {q^{2}N}} \right)}}{pq} \right\rceil.}$

-   -   This is a reformulation of (41) in light of the fact that r must         be an integer.     -   2—rank(Ψ)=M (the atoms of Ψ must be linearly independent for         columns of V to be linearly independent).     -   3—rank(Φ)=N (the atoms of Φ must be linearly independent for         columns of W to be linearly independent).     -   4—At most, the pair (Ψ,Φ) simultaneously accommodate the PPCs of         only one image.

Note that if the pair (Ψ,Φ) simultaneously accommodate the PPCs of exactly one image, then σ_(i)(W*V)=1, and, equivalently, dim(1)=1.

3. THE NEED FOR AN ARBITRATOR

In the previous two sections, we have seen that the intersection subspace of two HR subspaces based on two (different-resolution) LR dictionaries is at most 1-dimensional (if the four conditions listed above are satisfied). Relying on this knowledge, we now turn our attention to finding the HR image.

As is well-known if dim(U)=1, the easiest (and most computationally efficient) way to find a solution to (37) is to simply compute the right singular vector associated with the smallest (“0”) singular value of [V W]. Similarly, when (52) and (53) are satisfied, the solution to the alternative formulation (59) is the singular vector of (I−V*WW*V) associated with its smallest (“0”) singular value, which is also the right singular vector associated with the largest (“1”) singular value of W*V.

In practice, however, the pair of LR dictionaries are ‘learned’ from training (example) LR images and thus they would never simultaneously exactly accommodate the PPCs of the sought after HR image ū (or any other image for that matter). In other words, the intersection subspace is always empty if the conditions of Empirical Result 1 are satisfied (since, in practice, the pair of LR dictionaries do not, simultaneously, exactly accommodate the PPCs of any image).

Nevertheless, since σ_(i)(W*V)<1 is distinct, the optimal (in the Frobenius norm sense) approximate solution to (59), remains the right singular vector of W*V associated with σ_(i)(W*V). Alternatively, since the smallest singular value of [V W] is distinct iff σ_(i)(W*V) is distinct, then the optimal solution of (37) remains the right singular vector of [V W] associated with its smallest singular value.

Of course, our ultimate goal of solving (37) (or its equivalent formulation (59)) is to estimate u. However, an optimal solution to (37) does ‘not’ necessarily guarantee the optimality of the estimation of u. To explain with an (extreme) example, let u ₁ and u ₂ be two images such that

${{{\frac{\underset{\_}{u}}{\underset{\_}{u}\; } - \frac{{\underset{\_}{u}}_{1}}{{\underset{¯}{u}}_{1}}}} ⪡ {{\frac{\underset{\_}{u}}{\underset{\_}{u}\; } - \frac{{\underset{\_}{u}}_{2}}{{\underset{\_}{u}}_{2}}}}},$ i.e. u ₁ is a much better approximation of u than is u ₂, and suppose that the available pair of LR dictionaries simultaneously accommodate the PPCs of u ₂ exactly, while the same pair of dictionaries only approximate the PPCs of u ₁ (albeit very well). In this case, the exact solution of (37) will lead to the inferior approximation u ₂.

Again, in practice, the pair of (learned) dictionaries never do simultaneously accommodate the PPCs of any image, but the previous example helps to highlight the fact that solving (37) can be completely blind to whatever constitutes an optimal estimation of u. Put differently, if we are to rely entirely on (37) (to estimate the representation of the HR image in terms of the HR bases), then the learning process of the pair of LR dictionaries must be carefully designed to try to avoid picking inferior approximations of our sought after HR image.

Before we suggest an alternative to requiring a painstaking learning process of the pair of LR dictionaries, we first note that the solution to the following optimization problem

$\begin{matrix} {{\min\limits_{\underset{\_}{\alpha},\underset{\_}{\beta}}{{{{V\;\underset{\_}{\alpha}} - {W\;\underset{\_}{\beta}}}\; }^{2}\mspace{14mu}{s.t.\mspace{14mu}{\underset{¯}{\alpha}}^{2}}}} = 1} & (69) \end{matrix}$ is the same optimal solution to (59), i.e. the solution to (69) is also the right singular vector of W*V associated with σ_(i)(W*V).

Now consider the following modified optimization problem

$\begin{matrix} {{{\min\limits_{\underset{\_}{\alpha},\underset{\_}{\beta}}{\left( {{\;{{V\;\underset{\_}{\alpha}} - {W\underset{¯}{\beta}}}}^{2} + {\mu{{{\frac{1}{p^{2}}{\sum\limits_{i = 1}^{p^{2}}{\Psi{\underset{\_}{\alpha}}_{i}}}} - \underset{\_}{\overset{\_}{f}}}}^{2}}} \right)\mspace{14mu}{s.t.\mspace{14mu}{\underset{¯}{\alpha}}^{2}}}} = {c > 0}},} & (70) \\ {{{{where}\mspace{14mu}\underset{\_}{\overset{\_}{f}}}\; = {\frac{1}{\rho^{2}}\;{\sum\limits_{i = 1}^{p^{2}}{\underset{\_}{f}}_{i}}}},} & \; \end{matrix}$ where ƒ =1/p²∈Σ_(i=1) ^(p) ² ƒ _(i), the mean of the PPPCs of the HR image, is assumed to be known (for now), and μ is a control parameter. By adding the term

${{{\frac{1}{p^{2}}{\sum\limits_{i = 1}^{p^{2}}{\Psi{\underset{\_}{\alpha}}_{i}}}} - \underset{\_}{\overset{\_}{f}}}}^{2},$ we require the solution to be such that the mean of the estimated PPPCs be close to ƒ , which has the effect of solution ‘arbitration’ in favor of u.

Of course, ƒ is unknown, but what we do have in practice is the LR image, whose HR version we seek, and which we denote by x. Now since the (unknown) PPPCs of the (unknown) HR image would be highly correlated with x, then their unknown mean, ƒ , would also be highly correlated with x. Moreover, if x is well approximated by Ψ, i.e. ∥x−Ψ(Ψ*x)∥≈0, then we can use the following expression for arbitration in favor of u,

${{{{\frac{1}{p^{2}}{\sum\limits_{i = 1}^{p^{2}}{\Psi\;{\underset{\_}{\alpha}}_{i}}}} - {\Psi\left( {\Psi^{*}\underset{\_}{x}} \right)}}}^{2} = {{{\Psi\left( {{\frac{1}{p^{2}}{\sum\limits_{i = 1}^{p^{2}}{\underset{¯}{\alpha}}_{i}}} - {\Psi^{*}\underset{¯}{x}}} \right)}}^{2} = {{{{\frac{1}{p^{2}}{\sum\limits_{i = 1}^{p^{2}}{\underset{¯}{\alpha}}_{i}}} - {\Psi^{*}\underset{¯}{x}}}}^{2} = {{{\underset{¯}{\alpha}} - {\Psi^{*}\underset{¯}{x}}}}^{2}}}},$ where J∈R^(M×p) ² ^(M) is a 1×p² block matrix, scaled by the factor

$\frac{1}{p^{2}},$ with all p² blocks being equal to the identity matrix (of dimension M),

$\begin{matrix} {{\overset{\bigtriangleup}{=}{\frac{1}{p^{2}}\underset{\underset{p^{2}{blocks}}{︸}}{\begin{bmatrix} I_{M} & I_{M} & \ldots & I_{M} \end{bmatrix}}}},} & (71) \end{matrix}$ and therefore,

${\underset{\_}{\alpha}} = {\frac{1}{p^{2}}{\sum\limits_{i = 1}^{p^{2}}{{\underset{\_}{\alpha}}_{i}.}}}$

We are now ready to write a practical version of optimization problem (70)

$\begin{matrix} {{{\min\limits_{\underset{\_}{\alpha},\underset{\_}{\beta}}{\left( {{{{V\;\underset{\_}{\alpha}} - {W\underset{¯}{\beta}}}}^{2} + {\mu{{{\;\underset{\_}{\alpha}} - {\Psi^{*}\underset{\_}{x}}}}^{2}}} \right)\mspace{14mu}{s.t.\mspace{14mu}{\underset{\_}{\alpha}\; }^{2}}}} = {c > 0}},} & (72) \end{matrix}$ which has the closed-form solution (see the Equation Solution Section below) {circumflex over (α)}=μ[μJ*J+(1−σ)I−V*WW*V]⁻¹(J*Ψ*x )  (73) where σ is the smallest singular value of the matrix

[ μ ⁢ ⁢ * ⁢ + I - V * ⁢ WW * ⁢ V μ  Ψ * ⁢ x _  ⁢ * ⁢ Ψ * ⁢ x _ μ  Ψ * ⁢ x _  ⁢ ( * ⁢ Ψ * ⁢ x _ ) * μ ] ∈ ℝ ( p 2 ⁢ M + 1 ) × ( p 2 ⁢ M + 1 ) , ⁢ ( 74 ) and J*Ψ*x∈R^(p) ² ^(M) is simply p² replicas of Ψ*x∈R^(M), scaled by

$\frac{1}{p^{2}}.$

After estimating the representation of the HR image in terms of the HR basis V, all is left to get an estimate of the HR image is to use equation (16), i.e. û=V{circumflex over (α)}. However, recall (13) and (18) and partition {circumflex over (α)} into p² vectors, each of length M, i.e.

$\underset{¯}{\overset{\hat{}}{\alpha}} = {\begin{bmatrix} {\underset{\_}{\hat{\alpha}}}_{1} \\ {\underset{\_}{\hat{\alpha}}}_{2} \\ \vdots \\ {\underset{\_}{\hat{\alpha}}}_{p^{2}} \end{bmatrix}.}$ Therefore, û =V {circumflex over (α)}=interlace{Ψ{circumflex over (α)} _(i)}_(i=1) ^(p) ² .

Consequently, the construction of neither V nor W is required here. Only the product W*V is needed, which can be very efficiently computed using equations (62)-(68).

It must be re-emphasized, however, that problem formulation (72) is only one possible answer to the following question: How do we find a solution to (37), that is in favor of an optimal approximation of our sought after HR image? In other words, the HR basis matrices V and W only outline a structured subspace framework within which we have complete freedom to seek an estimate of u. Indeed, one can come up with a different objective function, combined with a different set of constraints (or lack thereof), in lieu of (72), but whatever optimization problem one chooses to solve, the matrices V and W will always be in the picture, one way or another.

In that sense, the structured subspace framework (37) can be seen as a conduit through which the pair of ‘LR’ dictionaries (Ψ,Φ) can generate (an estimate of) our ‘HR’ image. Moreover, we shall see next that the same framework provides the foundation for training of said ‘pair’ of LR dictionaries from a ‘single’ LR sequence.

Additionally, it goes without saying that any permutations of equation (37) are exactly equivalent to equation (37). Said differently, since a linear system of equations (e.g. (37)) remains exactly the same system of equations if you simply change the ordering of its equations, then any reformulation of V and W that amounts to permuting their rows does not change the solution space for which equation (37) was set up.

4. LEARNING PAIRS OF LR DICTIONARIES FROM A SINGLE LR SEQUENCE: THE BASELINE

Thus far, we have introduced the (unorthodox) notion that a pair of LR dictionaries can indeed be all we need for estimating a HR image, using the structured subspace model. Moreover, we proposed infusing an element of arbitration to the solution framework, to avoid practical difficulties that might arise with learning a pair of LR dictionaries. In this section we show how the same subspace structure can additionally be used for training pairs of LR dictionaries in the context of estimating HR images from a single LR sequence of images.

Before we proceed, we would like to highlight a notational change. Since we estimate the k-th HR frame, u ^(k), in a sequence of K frames U=[u ¹ u ² . . . u ^(K)], by estimating patches of it (patch-based processing), we will add the superscript ‘kl_(s)’ to our symbols to indicate that they are associated with estimating the l_(s)-th HR patch, u ^(kl) ^(s) ∈R^(d) ² , in the k-th frame u ^(k), where d=rpq (recall (2)). Specifically, since there is more than one way to partition the same frame into patches, we end up with multiple estimates of the same frame by computing all sets of patches that correspond to all possible partitionings. Let S denote the number of ways a frame can be partitioned, with L patches per partitioning, we use the notation û ^(k) =P({{ û ^(kl) ^(s) }_(l) _(s) ₌₁ ^(L)}_(s=1) ^(S))  (75) to indicate that the k-th HR frame is estimated by combining all SL estimated patches {{û ^(kl) ^(s) }_(l) _(s) ₌₁ ^(L)}_(s=1) ^(S), using some combination process P.

Now, let L denote a learning function (or procedure) that learns a LR dictionary (with orthonormal atoms), using a LR training sample and a training set of LR image patches. In particular, if x ^(k) denotes the k-th LR frame in a sequence of LR frames, X=[x ¹ x ² . . . x ^(K)] that correspond to (2D) decimation of the HR sequence U by a factor of p, i.e. X=D_(p) ₂ U, where D_(p) ₂ represents 2D decimation by a factor of p, then the LR patch x ^(kl) ^(s) ∈R^(r) ² ^(q) ² (corresponding to the HR patch u ^(kl) ^(s) ) is used as the training sample, around which a local set of M_(tr) LR patches X^(kl) ^(s) ∈R^(r) ² ^(q) ² ^(×M) ^(tr) is extracted from X. Specifically, we use the notation Ψ^(kl) ^(s) ≡L(X ^(kl) ^(s) ,x ^(kl) ^(s) )  (76) to signify that the LR dictionary Ψ^(kl) ^(s) ∈R^(r) ² ^(q) ² ^(×M) (expected to approximate the PPPCs of u ^(kl) ^(s) ) is learned from the training set X^(kl) ^(s) and the training sample x ^(kl) ^(s) , using the learning function L. Also, the expression X ^(kl) ^(s) ≡K(X,x ^(kl) ^(s) )  (77) indicates that the training set of patches is extracted from X around x ^(kl) ^(s) using some strategy K.

Similarly, the same learning function L can be used to learn the secondary dictionary Φ^(kl) ^(s) ∈R^(r) ² ^(p) ² ^(×N) (to approximate the SPPCs of u ^(kl) ^(s) ) if there exists a secondary sequence of LR images Y=[y ¹ y ² . . . y ^(K)], such that y ^(k)=D_(q) ² u ^(k) for k=1,2, . . . , K, where D_(q) ² represents 2D decimation by a factor of q. Namely Φ^(kl) ^(s) ≡L(Y^(kl) ^(s) ,y ^(kl) ^(s) ), where y ^(kl) ^(s) ∈R^(r) ² ^(p) ² is the secondary training sample (corresponding to u ^(kl) ^(s) ), and Y^(kl) ^(s) ∈R^(r) ² ^(p) ² ^(×N)tr is the secondary training set containing N_(tr) LR patches, i.e. Y^(kl) ^(s) ∈K(Y,y ^(kl) ^(s) ).

Following the same notational change for estimates corresponding to patches, the symbol V^(kl) ^(s) denotes the HR basis matrix constructed from Ψ^(kl) ^(s) , i.e. V^(kl) ^(s) =P(⊕_(i=1) ^(p) ² ,Ψ^(kl) ^(s) ). Similarly, W^(kl) ^(s) =Q(⊕_(i=1) ^(q) ² Φ^(kl) ^(s) ) is the secondary HR basis matrix. Now since we are going to use (72) to solve (37), we only need the construction of the product W*^(kl) ^(s) V^(kl) ^(s) , so to simplify presentation we use the following notation W* ^(kl) ^(s) V ^(kl) ^(s) ≡C(Ψ^(kl) ^(s) ,Φ^(kl) ^(s) ),  (78) to indicate that the matrix product W*^(kl) ^(s) V^(kl) ^(s) is constructed from the learned LR dictionary pair (Ψ^(kl) ^(s) ,Φ^(kl) ^(s) ), using equations (62)-(68).

Normally, however, an imaging system would only have one sensor, whose output is X, with p being simply the desired upsampling factor. In other words, a secondary sequence Y does not exist, and, therefore, neither does Y^(kl) ^(s) , nor y ^(kl) ^(s) . This obstacle can nevertheless be overcome by starting the solution with an initial estimate of the HR sequence. Specifically, let Û ₍₀₎≡ε(X)  (79) denote the initial estimate of the unknown HR sequence, based on the available LR sequence X, using some estimation process ε, then the first estimate of the secondary sequence is given by Y ₍₁₎ =D _(q) ₂ Û ₍₀₎,  (80) and the first version of the secondary LR dictionary can be learned Φ₍₁₎ ^(kl) ^(s) ≡L(Y₍₁₎ ^(kl) ^(s) ,y ₍₁₎ ^(kl) ^(s) ), where Y₍₁₎ ^(kl) ^(s) and y ₍₁₎ ^(kl) ^(s) denote the training set of LR patches, and the training sample, respectively, extracted from Y₍₁₎.

With both X and an initial guess Û₍₀₎ of the HR sequence at hand, our structured subspace model can be used in an iterative joint estimation of the HR sequence ‘and’ training of secondary LR dictionaries, as follows.

For a current estimate û ^(kl) ^(s) of the h HR patch in the k-th frame, first compute (recall (73)) {circumflex over (α)} ^(kl) ^(s) =μ[μJ*J+(1−σ_((t)) ^(kl) ^(s) )I−V* ^(kl) ^(s) W _((t)) ^(kl) ^(s) W _((t))*^(kl) ^(s) V ^(kl) ^(s) ]⁻¹(J*Ψ* ^(kl) ^(s) x ^(kl) ^(s) )  (81) with σ_((t)) ^(kl) ^(s) being the smallest singular value of (recall (74))

[ μ ⁢ ⁢ * ⁢ + I - V * k ⁢ ⁢ ℓ s ⁢ W ( t ) k ⁢ ⁢ ℓ s ⁢ W ( t ) * k ⁢ ⁢ ℓ s ⁢ V k ⁢ ⁢ ℓ s μ  Ψ * k ⁢ ⁢ ℓ s ⁢ x _ k ⁢ ⁢ ℓ s  ⁢ * ⁢ Ψ * k ⁢ ⁢ ℓ s ⁢ x _ k ⁢ ⁢ ℓ s μ  Ψ * k ⁢ ⁢ℓ s ⁢ x _ k ⁢ ⁢ ℓ s  ⁢ ( * ⁢ Ψ * k ⁢ ⁢ ℓ s ⁢ x _ k ⁢ ⁢ ℓ s ) * μ ] , ⁢ ( 82 ) and obtain the current estimate of the HR patch via (recall (13), (16) and (18)), û _((t)) ^(kl) ^(s) =V ^(kl) ^(s) {circumflex over (α)} _((t)) ^(kl) ^(s) =interlace{Ψ^(kl) ^(s) {circumflex over (α)} _(i,(t)) ^(kl) ^(s) }_(i=1) ^(p) ²    (83) where W*_((t))*^(kl) ^(s) V^(kl) ^(s) ≡C(Ψ^(kl) ^(s) ,Φ_((t)) ^(kl) ^(s) ), and Φ_((t)) ^(kl) ^(s) ≡L(Y_((t)) ^(kl) ^(s) ,y _((t)) ^(kl) ^(s) ), with Y_((t)) ^(kl) ^(s) and y _((t)) ^(kl) ^(s) being the training set, and training sample, respectively, extracted from the current secondary LR sequence Y_((t))=D_(q) ₂ U_((t−1)), where Û_((t−1)) is the previous estimate of the HR sequence.

After computing all SL current estimates of patches, {{û _((t)) ^(kl) ^(s) }_(l) _(s) ₌₁ ^(L)}_(s=1) ^(S), corresponding to all S partitionings of the k-th frame, find the current estimate of the k-th HR frame, û _((t)) ^(k)≡P ({{û _((t)) ^(kl) ^(s) }_(l) _(s) ₌₁ ^(L)}_(s=1) ^(S)), for k=1,2, . . . , K, to get a current estimate Û_((t))=[û _((t)) ¹ û _((t)) ² . . . û _((t)) ^(K)] of) the HR sequence.

TABLE 2 Pseudo code illustrating the basic solution baseline based on the proposed structured subspace framework. Input: A sequence  

  of K LR images, and the desired upsampling factor, p. Compute the initial estimate  

 ₍₀₎ ≡ ε( 

 ) of the HR sequence. For t = 1:T  Obtain  

_((t)) =  

 _(q) ₂  

 _((t−1)).  For k = 1:K   For s = 1:S    For  

_(s) = 1:L      

  Learn the primary LR dictionary:     Extract  

    Extract  

  ≡  

 ( 

 ).     Compute  

  ≡  

    (Note:  

  are iteration-independent).      

  Learn the secondary LR dictionary:     Extract  

    Extract  

  ≡  

      Compute  

  ≡  

       

  Estimate the HR image within the structured      subspace framework (37). We recommend (72)     Compute  

  ≡  

      Compute  

    Compute smallest singular value  

  of matrix (82).     Compute  

  (81).     Compute  

  (83).    End   End   Compute  

 End  Construct  

End Output:  

  = [û _((T)) ¹ û _((T)) ² ... û _((T)) ^(K)].

Repeat until a prescribed number of iterations, T, has been reached to get the final estimate Û of the HR sequence, Û≙Û _((T))=[ û _((t)) ¹ û _((t)) ² . . . û _((t)) ^(K)].  (84)

Refer to Table 2 and FIG. 3 for a summary of the baseline.

At this point, it is worthwhile to note that, all KSL estimates, {û ^(kl) ^(s) }, 1≤k≤K, 1≤s≤S, and 1←l_(s)≤L, needed to create the HR sequence Û_((t)), are computed completely independently from each other, and hence they can all be concurrently computed. Namely, if the computing hardware allows it, it is possible to parallel-process all KSL patches at once (per iteration).

Moreover, it should be noted that the proposed baseline is the most straightforward, and least computationally expensive for implementing the structured subspace framework. However, more complex baselines can still benefit from the structured subspace framework by jointly estimating HR patches, for example. In other words, the solution baseline can be devised such that the estimation of any patch is made dependent on the estimation of other patches (e.g. neighboring patches within the same frame, or patches across multiple estimates of the same frame, or even patches across different frames). However, we do not believe that the improvement in results, if any, would justify the added complexity. Specifically, the real power of our solution lies in the unprecedented access it provides to very narrow training sets (that are extracted from a naturally highly correlated sequence of LR images).

5. A WORKING SOLUTION

In the previous section we described a general baseline for iterative estimation of a HR sequence from a LR sequence, by learning pairs of LR dictionaries within a structured subspace framework. However, many details were (intentionally) left out. Specifically, which estimation process ε are we going to use to obtain an initial guess of the HR sequence? How about the learning function L? Regarding those local training sets, what are the specifics of their extraction 3C from a LR sequence? Which combination process P is going to be used to piece together all SL estimated HR patches per frame ? Indeed, what are the S different possible ways to partition a frame into patches?

The discussion of such details was postponed so as to help appreciate the cornerstone role of the structured subspace model, and to emphasize the level of freedom in the design of the baseline's remaining components. Indeed, as we shall see in the experiments section, we can get impressive results despite using some of the simplest outlines for ε, K, L, and P. This, again, underscores the baseline's most valuable asset: the structured subspace model which, in effect, leverages a sequence of LR images as a very narrow training set for estimating HR images.

A. The Initial Guess (ε)

For an initial estimate (79) of the HR sequence from the available LR sequence, we choose ε to simply represent Lanczos interpolation (by a factor of p). One might try more advanced options, but besides added complexity, even advanced methods would not give appreciably better estimates compared to simple image interpolation methods (such as bicubic or Lanczos) when the LR sequence contains complex motion patterns, and the aliasing is relatively strong.

B. Partitioning a Frame

In its simplest form, patch-based processing works by dividing a frame we desire to estimate into patches (sub-regions), and then applying the proposed estimation process for each individual patch, independently from other patches. By simply putting each estimated patch in its place, we get an estimate of the HR frame (i.e. an estimate of a HR frame is obtained by ‘tiling’ its estimated patches).

However, multiple estimates of the same frame can be obtained by dividing the frame into overlapping patches. To elaborate, since the size of a HR patch is d×d and d=rpq, if we use an overlap of pq pixels, vertically and/or horizontally, then a HR frame can be partitioned into patches in S=r² different ways. In particular, since the location of the ‘leading’ patch u^(kl) ^(s) ⁼¹ of the s-th partitioning determines the locations of the remaining patches (since patches are tiled next to each other, vertically and horizontally, per partitioning), we shall give a description of the location of the leading HR patch corresponding to partitioning s, as follows [2].

$\begin{matrix} {{u^{{k\;\ell_{s}} = 1} = {u^{k}\ \left( {{{{v(s)}pq} + {1\text{:}{v(s)}pq} + d},{{{h(s)}pq} + {1\text{:}{h(s)}pq} + d}} \right)}},{where}} & (85) \\ {{{v(s)} = {\left\lceil \frac{s}{r} \right\rceil - 1}},{{h(s)} = {{mod}\;\left( {{s - 1},r} \right)}},} & (86) \end{matrix}$ and A(r₁:r₂, c₁:c₂) denotes the submatrix of A, from row r₁ to row r₂, and column c₁ to column c₂.

Therefore, the corresponding leading LR patch x^(kl) ^(s) ⁼¹ of the k-th LR frame x^(k) is x ^(kl) ^(s) ⁼¹ =x ^(k)(v(s)q+1:v(s)q+rq,h(s)q+1:h(s)q+rq).  (87)

Similarly, the corresponding leading LR patch y_((t)) ^(kl) ^(s) ⁼¹ of the k-th (secondary) LR frame y_((t)) ^(k) is s y _((t)) ^(kl) ^(s) ⁼¹ =y _((t)) ^(k)(v(s)p+1:v(s)p+rp,h(s)p+1:h(s)+rp).  (88) C. Extracting Local Training Sets (K)

We follow the simple procedure K described in [2], wherein (overlapping) LR patches are extracted from within the spatiotemporal neighborhood of the patch x ^(kl) ^(s) , as follows.

-   -   Pick the κ LR frames in X that are (temporally) closest to the         k-th frame.     -   Pick the (spatial) location of the patch x ^(kl) ^(s) as the         origin.     -   Extract, from each one of the κ frames, (2b+1)² spatially         overlapping patches, starting at the origin, and moving         (vertically and horizontally, and in opposite directions) with a         step of only one pixel, and for as far as b pixels from the         origin.

The result is a (local) training set X^(kl) ^(s) containing M_(tr)=κ(2b+1)² LR patches that are extracted from within a spatiotemporal neighborhood around x ^(kl) ^(s) , with temporal width of κ frames, and vertical (horizontal) spatial width of (2b+1) pixels. The following pseudocode describes K more explicitly.

Suppose x^(kl) ^(s) =x^(k)(r₀+1:r₀+rq, c₀+1:c₀+rq), then a local training set can be extracted from X, around x^(kl) ^(s) , as follows.

(89) For i_(k) = −0.5κ + k : 0.5κ + k − 1  For i_(r) = −b:b   For i_(c) = −b:b    A = x^(i) ^(k) (r₀ + i_(r) + 1 : r₀ + i_(r) + rq, c₀ + i_(c) + 1 : c₀ + i_(c) + rq).    Put vec(A) as a column in  

    End  End End

Similarly, Y_((t)) ^(kl) ^(s) is extracted, around y _((t)) ^(kl) ^(s) , from Y_((t)), using the same exact procedure (with N_(tr)=M_(tr)=κ(2b+1)²).

D. Learning the Dictionaries (L)

Dictionary learning (L) can be based on feature selection (FS), feature extraction (FE), or a combination of both. In our case, FS far outweighs FE. In particular, PPCs are highly correlated signals, so learning a dictionary that represents them well would be heavily dependent on choosing those features (LR patches) in the training set that would capture the subtle differences between the PPCs [2].

To elaborate, since the PPCs are expected to be highly correlated with x ^(kl) ^(s) , we use it as a training sample for selecting the M«M_(tr)‘best’ LR patches in X^(kl) ^(s) . To that end, we use best individual feature (BIF) selection based on L1 distance between

$\frac{{\underset{¯}{x}}^{k\;\ell_{s}}}{{\underset{¯}{x}}^{k\;\ell_{s}}}$ and normalized LR patches in X^(kl) ^(s) . In other words, we select a subset X_(m) ^(kl) ^(s) with only M LR patches out of the M_(tr)=κ (2b+1)² LR patches in X^(kl) ^(s) , where the elements in the selected subset are simply the normalized LR patches in the training set that have the smallest L1 distance from the normalized training sample.

Now, since some of our equations are based on the (simplifying) assumption that the dictionary atoms are orthonormal, all is left to do after selecting the best M LR patches is to simply orthonormalize them. This can be done, for example, using the Gram Schmidt method (QR factorization). However, we shall be using the singular value decomposition (SVD), since it keeps the door open for further dimensionality reduction if so desired. In other words, our local dictionary Ψ^(kl) ^(s) is simply the first M left singular vectors of the selected subset X_(M) ^(kl) ^(s) . If {tilde over (M)}<M is desired, then we simply keep the first {tilde over (M)} left singular vectors instead.

Likewise, Φ_((t)) ^(kl) ^(s) is the first N left singular vectors of the N-element subset Y_(N,(t)) ^(kl) ^(s) selected from the (normalized) training set Y_((t)) ^(kl) ^(s) , using the BIF method based on the smallest L1 distance from

$\frac{{\underset{\_}{y}}_{(t)}^{k\;\ell_{s}}}{{\underset{¯}{y}}_{(t)}^{k\;\ell_{s}}}.$

Clearly, the dictionary learning process described here is exceedingly simple, yet it works surprisingly well. It must be noted, however, that this simplicity of dictionary learning is afforded to us by the ‘narrowness’ of the training sets, which, in turn, is attributed to the ‘high correlation’ between images in a LR sequence and the PPCs of a HR frame (FIG. 1). Yet, without the structured subspace framework as a tool to harness the power of narrow training LR sets for estimating HR frames, we would have been confined to the imaging hardware requirement of [1], [2].

E. Combining Multiple Estimates of a HR Frame (P)

Given Ψ^(kl) ^(s) and Φ_((t)) ^(kl) ^(s) (and x ^(kl) ^(s) ) for 1≤l_(s)≤L, we can estimate û _((t)) ^(kl) ^(s) for 1≤l_(s)≤L, and tile all estimated patches into the s-th estimate û _(s,(t)) ^(k) of the k-th HR frame. Repeating this for all s (1≤s≤S=r²), we get S=r² estimates {û _(s,(t)) ^(k)}_(s=1) ^(r) ² of the k-th HR frame.

So now, what do we do with all these estimates of the same frame ? One of the simplest options is to average all r² estimates. We, nevertheless, choose to follow the solution proposed in [2] to get the final (per iteration t) estimate û _((t)) ^(k) of the k-th HR frame, as follows.

$\begin{matrix} {{{\underset{¯}{\hat{u}}}_{(t)}^{k} = {\min\limits_{{\underset{¯}{u}}_{(t)}^{k}}{\sum\limits_{s = 1}^{r^{2}}{\sum\limits_{w_{1}}{\sum\limits_{w_{2}}{{{H{\underset{¯}{u}}_{(t)}^{k}} - {R_{w_{1},w_{2}}{\underset{\_}{\hat{u}}}_{s,{(t)}}^{k}}}}_{1}}}}}},} & (90) \end{matrix}$

where R_(w) ₁ _(w) ₂ shifts the s-th estimate by w₁ and w₂ pixels in the horizontal and vertical direction, respectively, −(ω−1)/2≤w₁,w₂≤(ω−1)/2, and H represents a blurring kernel, to be defined by the user, to counteract the softening effect of median filtering (across all r² estimates, and within a spatial window of size ω×ω, per pixel).

F. Solution Parameters

Now we turn to the solution parameters, and start with the integer scalar r. Given that, in practice, p is the user-defined upsampling factor, and given that q=p+1 (1), then r is the only parameter left to determine the size of the HR patch (2) or, in particular, r determines how small (41) the HR patch can be. Before we continue, now is the time to address the question: why would we want to work on patches of a frame (patch-based processing), instead of upsampling an entire frame as a whole (i.e. with r being large enough to engulf the entire frame)?

The answer to this question is in [2], but we reproduce it here for convenience. First, the short version: the more ‘dynamic’ the LR sequence, the greater the need for patch-based processing, with particularly small patches. The longer version of the answer would require revisiting FIG. 1 to notice that the inter-correlations between the PPCs are much greater than the correlations that exist between the LR frames (of a dynamic scene) and the PPCs (of a frame). In other words, a ‘training’ set of LR frames would not capture well the subtle differences between the PPCs of a HR frame as a whole. Note that in addition to a basic common component the PPCs might share, these subtle differences are, ultimately, what gives us the HR frame. Working on smaller sub-regions (patches), however, allows us to harness, from the LR frames, local training sets (as described above) from which local dictionaries can be learned for estimating HR patches. In other words, the smaller the patch, the more ‘local’ the training sets (and the dictionaries) get.

On the other hand, larger patches (larger r) allow for the advantage of a more overdetermined (38). So to keep things simple, when the desired upscaling factor p=3, we fix the dimensionality of all LR dictionaries at 3q², i.e. M=N=3q², and let r=4. For p=4, we use r=3 and M=N=2q².

Now, how large a local training set can be (recall N_(tr)=M_(tr)=κ(2b+1)²)? Ideally, we would want to search for ‘best’ LR patches in as large a spatiotemporal neighborhood as possible, i.e. κ and b both can be as large as possible. However, and even though using BIF selection based on L1 distance from a training sample is a very low complexity FS policy, with more and more LR patches to choose from, the computational cost of total FS (performed for all patches) can get quite significant if K and b are too large. For that reason, we pick κ=30 and b=5.

Finally, for combining multiple estimates of the same frame (90), we choose H to be a Gaussian kernel with size 5 and standard deviation of 1, and we pick ω=3.

G. The Control Parameter μ

Recall that equation (81) and (82) are simply the patch-based, iteration-dependent versions of equations (73) and (74), respectively. Yet, the control parameter μ in these equations appears patch-independent as well as iteration-independent. Can this indeed be the best strategy for selecting μ? To use a fixed value across all patches and throughout all iterations?

First, recall that μ determines how close to the reference LR image should the mean of the PPCs of the estimated image be. Therefore, if μ is too large, we run the risk of an estimated HR image that has PPCs that are too close to each other (a solution with some residual aliasing). On the other hand, in practice, if μ is not high enough, the end result can be too smooth, with low contrast, especially for those parts of the scene that are too dynamic (large scene changes across captured frames). In other words, instead of using the symbol μ in equations (81) and (82), we could use μ_((t)) ^(kl) ^(s) to account for the patch and iteration dependency in selecting the control parameter.

Nevertheless, choosing the “right” value for μ is not easy. According to experiments, the range of good values can be quite large (0.1≤μ≤5), and a good choice can be dependent on many factors including high spatial frequency content per patch, patch-size, and selected dictionary atom diversity. Currently, we use the following empirical formula for determining good values for μ (per-patch and per-iteration).

$\begin{matrix} {{\mu_{(t)}^{k\;\ell_{s}} = {\min\ \left( {{\max\ \left( {{\mu_{0}\frac{d^{2}}{{p^{2}M} + {q^{2}N}}\frac{\gamma}{\tau}},0.1} \right)}\ ,5} \right)}},{where}} & (91) \\ {{\tau = \frac{{{y_{(t)}^{k\;\ell_{s}}**\begin{bmatrix} 1 & {- 1} \\ {- 1} & 1 \end{bmatrix}}}_{F}^{2}}{r^{2}p^{2}}},} & (92) \end{matrix}$ ** denotes 2D convolution, ∥·∥_(F) is the Frobenius norm, μ₀ is a user-defined scalar that is fixed across all iterations and all patches (we pick μ₀=20), and γ is a measure of the diversity of selected atoms computed as follows.

-   -   1—Find the correlation coefficient between x ^(kl) ^(s) and each         atom in X_(M) ^(kl) ^(s) .     -   2—Assign a value of 1 for correlation coefficients higher than         0.99, a value of 3 for correlation coefficients between 0.95 and         0.99, and a value of 10 for correlation factors below 0.95.     -   3—γ is the average of all assigned values.

No matter how good an empirical formula for selecting μ_((t)) ^(kl) ^(s) might be, if the value for μ₀ is too high for some frames (or sub-regions of a frame), we would end up with estimated HR frames that contain regions with some residual aliasing. If that is the case, we propose the following remedy.

After obtaining the final estimate Û≙Û_((T))=[û _((T)) ¹ û _((T)) ² . . . û _((T)) ^(K)] of the HR sequence (we pick T=4), we start the solution over, but this time we use Û as our input sequence of LR images, and we keep all the parameters the same except for μ and r. Specifically, we keep μ fixed at the low value of 0.2, and use r=7 for p=3, and r=5 for p=4. This should take care of residual aliasing. The final sequence can then be resized down to the original desired frame size (i.e. each frame can be decimated by a factor of p).

6. RESULTS

In this section we test the proposed solution using the ‘Suzie’ sequence of HR frames of size 486×720 each. First, we decimate each frame by a factor of 6 (vertically and horizontally). The top row of FIG. 4 shows some of the LR frames magnified by a factor of 3 using Lanczos interpolation. Corresponding upsampling results of the proposed solution using an upsampling factor of p=3 are shown in the bottom row.

We repeat the same experiment using a decimation factor of 8, and an upsampling factor of p=4. FIG. 5 shows Lanczos-magnified LR images vs. upsampling.

If we compare both FIG. 4 and FIG. 5, it becomes immediately evident that the upsampling quality is higher for p=3 compared to p=4. Of course, this can be justified by the fact that the LR sequence of FIG. 4 is less degraded than FIG. 5 LR sequence. But why, specifically in our case, is it easier to get better results for lower upsampling factors? It all goes back to (local) LR dictionaries' ability to capture the subtle differences between PPCs. Specifically, the higher the upsampling factor needs to be, the higher the number of PPCs, and the more difficult it becomes to represent the subtle details differentiating between PPCs, especially when the scene is highly dynamic. Moreover, with larger upsampling factors, the patch size has to be larger (recall (2) and (41)), and the larger the patches the more difficult it becomes to find good example images for learning local dictionaries.

However, this gap in upsampling quality (e.g. p=4 vs. p=3) would become smaller when the LR sequence is not highly dynamic (specifically, when scene changes, across a set of captured frames, are not too large because the frame rate is sufficiently high).

7. CONCLUSION

The basic principle of learning-based image upsampling is fairly simple. In general, learning-based methods use the available LR image as ‘partial measurements’ (of the unknown HR image) to estimate the representation of the HR image in terms of a HR dictionary learned from a training set of HR example images. While these methods certainly differ in the details, the two most important features that account for most of the variation in results are the training sets they use (generic vs. narrow—special—sets) and the learning process of the HR dictionaries.

In contrast, the work in [1], [2], uses the same learning-based upsampling principle, although for different target signals: the PPCs of the HR image, which are LR signals themselves. This shift of focus allowed the authors of [1], [2] to exploit a sequence of LR images as a source of very narrow training sets, from which highly efficient LR dictionaries can be easily learned to represent the PPCs (of sought after HR images). The major obstacle to their idea was the lack of ‘partial measurements’ required to find the representations of the PPCs in terms of the LR dictionaries. To overcome this obstacle, they proposed a hardware modification such that the imaging device is equipped with another (different resolution) LR sensor (and a beam splitter) to provide the much needed partial measurements for their target images (the PPCs).

Compared to [1], [2], in current work, we shift the focus back to estimating the representation of the HR image itself, and in terms of a pair of HR bases, each of which is embedding a (different resolution) LR dictionary. The end result is a structured subspace framework through which pairs of LR dictionaries are used to estimate HR images directly, thus circumventing the very restrictive hardware assumption required in [1],[2], while still benefiting from the huge advantage of harvesting narrow training sets from a LR sequence of images.

Applied Example of Working Solution

In this section, we give a visualization of the basic solution baseline whose details were laid out above in “A Working Solution”. To help with understanding, it is important to keep the big picture in mind, and which we summarize as follows:

We estimate the entire HR sequence by estimating patches (pieces) of each frame.

Because we estimate each HR patch based on a pair of (local, different resolution) LR dictionaries, we need a pair of LR sequences (of different resolution) from which to extract the pair of local dictionaries (the algorithm takes in a pair of LR dictionaries, per patch, as input, and spits out an estimate of the HR patch).

The reason we need to iterate the solution is because we do NOT have the secondary (different resolution) LR sequence (we keep estimating a better version of the missing secondary LR sequence).

The Initial Guess (ε)

Let's first have a look at sample LR frames of an available LR sequence (we call it the primary LR sequence) in FIG. 6.

To get the first estimate of the secondary (missing) sequence Y₍₁₎, we need to first get an initial guess of the HR sequence Û₍₀₎. This can be done, for example, by using 2D interpolation (by a factor of p, we choose p=3 here) of each frame x^(k) of the primary (available) LR sequence X. Using Matlab, this can be done as follows:

(93) for k = 1:K  û₍₀₎ ^(k) = imresize (x^(k),p,‘lanczos3’); end

Now, let's take a look at the sample frames of the initial estimate of the HR sequence, shown in FIG. 7. Comparing FIG. 7 to FIG. 6, it becomes clear that the initial guess of the HR frames don't look appreciably better than the available (primary) LR frames, but this shall suffice for an initial guess. Note: each frame shown in FIG. 7 is actually p² times bigger than the corresponding frame shown in FIG. 6.

First Iteration (t=1)

To obtain the first estimate of the secondary (different/lower resolution) LR sequence, we simply decimate each frame of the HR sequence by a factor of q (q=p+1=4 here). Using Matlab, this can be done using the following code:

(94) for k = 1:K  y₍₁₎ ^(k) = û₍₀₎ ^(k) (1:q:end,1:q:end); end

Because of the size of the figures, comparing FIG. 8 to FIG. 6, it might not be easy to see that the first estimate of the secondary LR sequence is lower resolution than the primary LR sequence, so in FIG. 9, we compare bigger versions of one of the frames (frame #31) from the primary and secondary sequences. It might still not be easy to see, but careful examination reveals the resolution is different.

Partitioning a Frame

So now that we have two (different resolution) LR sequences as input, X and Y₍₁₎, how do we proceed? Like (almost) everyone else, we do not estimate an entire HR frame as a whole, instead we estimate patches (pieces) of each frame, so the next question is: how do we partition a frame into patches to be estimated?

In Section 5 (A Working Solution), we provided a description of the simplest partitioning scheme (equations (85)-(88)). For a pictorial illustration, we pick frame #31 of the primary sequence X and display, in FIG. 10, the S=r² possible ways of partitioning the same frame (we pick r=4 here, so each primary LR patch x^(kl) ^(s) has size rq×rq=16×16).

The so-called ‘leading’ patch per partitioning pattern s is shown as a brightened square in FIG. 10. We use the description ‘leading’ patch because it simply tells us how to cut up a frame (its location defines the partitioning pattern). So a frame is estimated in patches (pieces), and there are multiple ways to cut up a frame into patches.

Now, what happens when we compute all the HR patches corresponding to all the squares (patches) shown in FIG. 10? We get S=r²=16 estimates of the same HR frame.

But why don't we simply use just one partitioning pattern? There's nothing wrong with that except that getting more estimates of the same frame (by partitioning it using S=r² patterns instead of just one pattern), allows us to reduce estimation errors since different patterns would give different estimation errors and therefore having multiple estimates of the same frame allows us to reduce estimation errors. There are many different ways one could use multiple estimates of the same frame to reduce estimation errors (equation (90), for example, is only one of them), and most people simply take the mean—or the median—of all estimates.

To illustrate the benefits of having multiple estimates of the same frame, we show in FIG. 11 the S=r²=16 HR estimates of frame #31 after tiling (in place) all estimated HR patches {û₍₁₎ ^(kl) ^(s) }, corresponding to all LR patches {x^(kl) ^(s) }, shown in FIG. 10. Some of the most obvious estimation errors are present in some of the ‘edge’ patches, but beyond these obvious errors, subtle errors are present (and different) per the same image part. For example, if we concentrate on the mouth region, we′d see that it looks a little different across all 16 estimates.

FIG. 12 shows what we get if we compute the median of all 16 estimates of frame #31 shown in FIG. 11 vs. the initial estimate of the same frame (obtained using Lanczos interpolation).

But how did we compute each of the HR patches shown in FIG. 11? For example, how did we compute the HR patch û₍₁₎ ^(kl) ^(s) at k=31, s=4, and l_(s)=20? Let's highlight the patch in question in FIG. 13.

Extracting Local Training Sets (K)

Recall that, in our solution, estimating a HR patch requires a local pair of (different resolution) dictionaries to be extracted from a pair of LR sequences (of different resolution). We already had LR sequence X (FIG. 6) and from which we created Y_((i)) (FIG. 8). So now, we visualize how we extract the training sets X^(kl) ^(s) and Y₍₁₎ ^(kl) ^(s) from the LR sequences X and Y₍₁₎, respectively, in preparation for computing the highlighted patch shown in FIG. 13.

First of all, recall parameters K (the width of the temporal neighborhood of frames around frame k from which training LR patches are to be extracted) and b (2b+1 is the width and height, in pixels, of the spatial window whose center is defined by the location of the LR patch corresponding to the HR patch we need to estimate). Here, we choose K=30 frames, and b=5 pixels. FIG. 14 illustrates the extraction process (X) of example LR patches to be used as elements of the pair of training sets.

Learning the Dictionaries

With (2b+1)²=121 LR patches extracted from each frame in a predefined temporal neighborhood of size K=30 frames, the size of the entire training set X^(kl) ^(s) is 30×121=3,630 LR patches (similarly, training set Y₍₁₎ ^(kl) ^(s) has 3,630 LR patches).

Clearly, however, we do not need all patches in a training set. Indeed, just by looking at FIG. 14, it becomes evident that most of the extracted patches are irrelevant, anyway. But then why do we extract so many LR patches? The point is to find LR patches that are similar to the LR patch we want to upsample, so the extraction process described here is our way for ‘fishing’ for good example LR patches. And although most of the ‘catch’ is useless, it doesn't matter as long as we have enough ‘good’ LR patches in our training set.

Before we proceed, here we use M=N=2q²=32 as the number of (hopefully) ‘good’ enough LR patches to be chosen from each training set. All is left to do is define a measure of ‘goodness’. The following steps summarize the dictionary “learning” process we described in Section 5 (A Working Solution).

First, execute the following pseudocode:

For i = 1: κ(2b + 1)² $\mspace{20mu}{{d_{x}\lbrack i\rbrack} = {{\frac{X^{k\;\ell_{s}}\lbrack i\rbrack}{{X^{k\;\ell_{s}}\lbrack i\rbrack}} - \frac{x^{k\;\ell_{s}}}{x^{k\;\ell_{s}}}}}_{1}}$ (95) $\mspace{20mu}{{d_{y}\lbrack i\rbrack} = {{\frac{Y_{(1)}^{k\;\ell_{s}}\lbrack i\rbrack}{{Y_{(1)}^{k\;\ell_{s}}\lbrack i\rbrack}} - \frac{y_{(1)}^{k\;\ell_{s}}}{y_{(1)}^{k\;\ell_{s}}}}}_{1}}$ End

where the LR patches x^(kl) ^(s) and y₍₁₎ ^(kl) ^(s) correspond to the HR patch you want to estimate (these are the highlighted areas in the left and right LR frames, respectively, shown in the middle row of FIG. 14).

The i-th entry in d_(x) is thus the value of the L1 distance between the i-th normalized LR patch in training set X^(kl) ^(s) and normalized (reference) LR patch x₍₁₎ ^(kl) ^(s) . Similarly, the i-th entry in d_(y) is the value of the L1 distance between the i-th normalized LR patch in training set Y₍₁₎ ^(kl) ^(s) and normalized LR patch y₍₁₎ ^(kl) ^(s) .

Second, pick the M LR patches, in the training set X^(kl) ^(s) , that correspond to the smallest M entries in d_(x). These are the atoms of your local primary dictionary Ψ^(kl) ^(s) . Similarly, the atoms of the local secondary dictionary Φ₍₁₎ ^(kl) ^(s) are the N LR patches, in the training set Y₍₁₎ ^(kl) ^(s) , that correspond to the smallest N entries in d_(y).

Third, since it's easier to work with orthonormal dictionaries, use SVD decomposition to orthonormalize the atoms of each dictionary. After converting atoms, of each dictionary, from their 2D form to their vector form, and stacking these (per dictionary) as column-vectors next to each other, we can use the following Matlab code to orthonormalize our dictionaries: [Ψ^(kl) ^(s) ,˜,˜]=svd(Ψ^(kl) ^(s) ,0); [Φ₍₁₎ ^(kl) ^(s) ˜,˜]=svd(Φ₍₁₎ ^(kl) ^(s) ,0);  (96)

FIG. 15 visualizes the pair of dictionaries we used to compute the highlighted patch in FIG. 13.

Computing the HR Patch

All the previous steps were taken to set the stage for the proposed structured subspace framework to do its work: converting a pair of (different resolution) LR dictionaries into a HR image. In the following, we describe the most straightforward application of the structured subspace solution.

First, construct the HR basis matrix V^(kl) ^(s) from the LR dictionary Ψ^(kl) ^(s) , and the HR basis matrix W₍₁₎ ^(kl) ^(s) from the LR dictionary Φ₍₁₎ ^(kl) ^(s) , by running the following Matlab code: V ^(kl) ^(s=LR) 2HRbasis(Ψ^(kl) ^(s) ,r,p,q,M); Ψ₍₁₎ ^(kl) ^(s=LR) 2HRbasis(Φ₍₁₎ ^(kl) ^(s) ,r,q,p,N);  (97) Recall that we chose p=3 (and thus q=p+1=4), r=4, and M=N=2q²=32. LR2HRbasis is a predefined function written using Matlab as follows:

(98) % function to construct HR basis from LR dictionary function V = LR2HRbasis(PSI,r,p,q,M) d = r*p*q; PSI = reshape(PSI,r*q,r*q,M); % this line converts % the vectorized % atoms (columns) % of PSI back to % their 2D form V = zeros(d*d,p*p*M); zrs = zeros(d,d,M); c = 0; for i = 1:p  for j = 1:p   c = c+1;   atomZshift = zrs;   atomZshift(i:p:end,j:p:end,:) = PSI;   V(:,(c−1)*M+1:c*M) = reshape(atomZshift,d*d,M);  end end

Second, solve the following equation whichever meaningful way possible: V^(kl) ^(s) α ₍₁₎ ^(kl) ^(s) =W₍₁₎ ^(kl) ^(s) β ₍₁₎ ^(kl) ^(s) . Recall:

-   -   V^(kl) ^(s) is the HR basis matrix that spans any HR image         (patch) whose PPCs are spanned by the LR dictionary Ψ^(kl) ^(s)         .     -   W₍₁₎ ^(kl) ^(s) is the HR basis matrix that spans any HR image         (patch) whose PPCs are spanned by another (different resolution)         LR dictionary Φ^(kl) ^(s) .     -   α ₍₁₎ ^(kl) ^(s) is the representation of (first estimate of)         the HR image (patch) in terms of V^(kl) ^(s) .     -   β ₍₁₎ ^(kl) ^(s) is the representation of the same HR image in         terms of W₍₁₎ ^(kl) ^(s) .     -   Solving this equation is the equivalent of searching for the         pair of HR images (one image in span(V^(kl) ^(s) ), and the         other image in span(W₍₁₎ ^(kl) ^(s) )) that are ‘closest’ to         each other. So what remains is to define the “distance measure”,         or the ‘yardstick’ with which distance is measured. We believe a         good yardstick for measuring distance, in this context, is         defined by optimization problem (72).     -   Using this yardstick (72), it just so happens that we do not         need to construct V nor W, only the multiplication W*V is needed         which, due to the particular structure of V and W, can be very         efficiently computed using equations (62)-(68). However,         generally speaking, other yardsticks one might choose to use         (other than (72)) might require the explicit construction of V         and W. For this reason, we shall ignore, in this demonstration,         the special computational efficiency advantage imparted by (72).     -   Since we're working on patches, x^(kl) ^(s) is the reference LR         image here (the highlighted square in the LR frame shown on the         left of the middle row of FIG. 14) whose HR version (the         highlighted square in FIG. 13) we seek to compute.

The following is the Matlab code we used for computing the HR image patch highlighted in FIG. 13. û ₍₁₎ ^(kl) ^(s) =computeHRpatch(V ^(kl) ^(s) ,W ₍₁₎ ^(kl) ^(s) ,Ψ^(kl) ^(s) ,x ^(kl) ^(s) ,μ₍₁₎ ^(kl) ^(s) ,r,p,q,M);  (99) where the control parameter μ₍₁₎ ^(kl) ^(s) determined according to (91), and computeHRpatch is a predefined function as follows:

% function to solve Vα = Wβ, according to % optimization problem (72). function u = computeHRpatch(V,W,PSI,x,mu,p,M) A = W′*V; A = A′*A; x = x(:); % get the vector form of % the reference LR image. b = PSI′*x; % i.e. b = Ψ*x. brep = repmat(mu/p/p/norm(b)*b,p*p,1);                 $\%\mspace{14mu}{this}\mspace{14mu}{is}\mspace{14mu}\frac{\mu}{{\Psi^{*}\underset{\_}{x}}}\mathcal{J}^{*}\Psi^{*}{\underset{\_}{x}.}$ J = 1/p/p*repmat(eye(M),1,p*p); % this is eqn (71). (100) J = J′*J; E = zeros(p*p*M+1); % construct the matrix in (74). E(1:p*p*M,1:p*p*M) = mu*J +eye(p*p*M) −A; E(1:p*p*M,p*p*M+1) = brep; E(p*p*M+1,1:p*p*M) = brep′; E(p*p*M+1,p*p*M+1) = mu; sigma = svd(E); sigma = sigma(end); A = mu*J + (1−sigma)*eye(p*p*M) −A; brep = repmat(mu/p/p*b,p*p,1); alpha = A \ brep; % this is eqn (73). u = V * alpha; u = reshape(u,r*p*q,r*p*q); % get the 2D form of % the estimated HR image. Parallel Processing: Thus far, we explained how we got the HR patch highlighted in FIG. 13, which is patch û₍₁₎ ^(kl) ^(s) at k=31, s=4, and l_(s)=20, but that's just one patch among 48 patches (l_(s)=1, . . . , 48) per partitioning pattern s=4, and we have S=16 partitioning patterns with 48 patches per partitioning (FIG. 11). In our simple baseline, all of these HR patches are computed independently from each other, so if the computing hardware allows it, they can all be computed simultaneously, and for all K frames too. So if we have K=100 frames, we can compute 100*16*48=76,800 patches simultaneously, and then arrange them as 16 HR estimates per frame, and then compute the median of all 16 estimates per frame to get the first estimate of the our HR sequence Û₍₁₎. Of course, this can also be done in series, computing one HR patches at a time. In any case, parallel computing is beyond the scope of this invention.

2nd and Subsequent Iterations

Compared to the first iteration, the second iteration (and subsequent iterations) are no different except for working with an updated estimate of the secondary LR sequence, which is obtained by simply decimating the previous estimate of the HR sequence (e.g. we get the updated sequence Y₍₂₎ by decimating each frame in Û₍₁₎ by a factor of q).

In particular, the primary LR sequence X, remains the same for all iterations, so unless we adopt a different training set extraction strategy (X) or a different dictionary learning procedure (L) per iteration, there is no need to repeat the training/learning process of local primary LR dictionaries. For example, if we stored Ψ^(kl) ^(s) shown in FIG. 15, we do not need to repeat its extraction process for any iteration beyond the first one. This is why the symbol Ψ^(kl) ^(s) is missing the subscript (t).

Equation Solution Section

To solve the optimization problem (72) using Lagrange multipliers, we first rewrite (72) as

$\begin{matrix} {{\min\limits_{\underset{¯}{\alpha},\underset{¯}{\beta}}\left( {{{{V\underset{¯}{\alpha}} - {W\underset{¯}{\beta}}}}^{2} + {\mu{{\begin{bmatrix}  & {\Psi^{*}\underset{¯}{x}} \end{bmatrix}\begin{bmatrix} \underset{\_}{\alpha} \\ {- 1} \end{bmatrix}}}^{2}}} \right)}\;{{s.t.\mspace{14mu}{\underset{¯}{\alpha}}^{2}} = {c > {0.{Now}\mspace{14mu}{let}}}}} & \left( {A{.1}} \right) \\ {{\underset{¯}{\overset{˜}{\alpha}} = {\left. \begin{bmatrix} \underset{\_}{\alpha} \\ {- 1} \end{bmatrix}\Rightarrow\underset{¯}{\alpha} \right. = {E\underset{¯}{\overset{˜}{\alpha}}}}},{where}} & \left( {A{.2}} \right) \\ {{E = {\begin{bmatrix} I_{p^{2}M} & \underset{\_}{O} \end{bmatrix} \in {{\mathbb{R}}^{p^{2}M \times {({{p^{2}M} + 1})}}.{Also}}}},{let}} & \left( {A{.3}} \right) \\ {{R = \begin{bmatrix}  & {\Psi^{*}\underset{¯}{x}} \end{bmatrix}},} & \left( {A{.4}} \right) \end{matrix}$ and rewrite (A.1) as

$\begin{matrix} {{\min\limits_{\overset{\sim}{\underset{¯}{\alpha}},\underset{¯}{\beta}}{\left( {{{{V\; E\;\underset{¯}{\overset{\sim}{\alpha}}} - {W\underset{¯}{\beta}}}}^{2} + {\mu{{R\overset{\sim}{\underset{¯}{\alpha}}}}^{2}}} \right)\mspace{14mu}{s.t.\mspace{14mu}{\overset{\sim}{\underset{¯}{\alpha}}}^{2}}}} = {\overset{\sim}{c} > 0.}} & \left( {A{.5}} \right) \end{matrix}$ Let ƒ({tilde over (α)} β)=∥VE{tilde over (α)}−Wβ∥²+μ∥R{tilde over (α)}∥², and recall (54), (55). Therefore, the objective function ƒ ({tilde over (α)},β) can be rewritten as ƒ({tilde over (α)},β)={tilde over (α)}*(E*E+μR*R){tilde over (α)}−2{tilde over (α)}*E*V*Wβ+∥β∥ ².   (A.6)

Also, let g({tilde over (α)},β)=∥{tilde over (α)}∥² −{tilde over (c)}  (A.7)

Since we only have one constraint (A.7), there is only one Lagrange multiplier, which we denote with λ, and the Lagrangian is therefore L({tilde over (α)},β,λ)=ƒ({tilde over (α)},β)−λg({tilde over (α)},β).  (A.8)

Now the gradient of ƒ({tilde over (α)},β), with respect to {tilde over (α)} and β is

$\begin{matrix} {{{\nabla_{\overset{\sim}{\underset{¯}{\alpha}},\underset{¯}{\beta}}f} = \begin{bmatrix} {{2\left( {{E^{*}E} + {\mu R^{*}R}} \right)\overset{\sim}{\underset{¯}{\alpha}}} - {2E^{*}V^{*}W\underset{¯}{\beta}}} \\ {2\left( {\underset{¯}{\beta} - {W^{*}VE\underset{¯}{\overset{\sim}{\alpha}}}} \right)} \end{bmatrix}}{{Also},}} & \left( {A{.9}} \right) \\ {{{\nabla_{\underset{¯}{\overset{\sim}{\alpha}},\underset{¯}{\beta}}g} = \begin{bmatrix} {2\underset{\_}{\overset{\sim}{\alpha}}} \\ \underset{\_}{O} \end{bmatrix}}{{Therefore},}} & \left( {A{.10}} \right) \\ {{\nabla_{\overset{\sim}{\underset{¯}{\alpha}},{\underset{¯}{\beta,}\lambda}}\mathcal{L}} = {{2\begin{bmatrix} {{\left( {{E^{*}E} + {\mu R^{*}R}} \right)\overset{\sim}{\underset{¯}{\alpha}}} - {E^{*}V^{*}W\underset{¯}{\beta}} - {\lambda\overset{\sim}{\underset{¯}{\alpha}}}} \\ {\underset{¯}{\beta} - {W^{*}V\; E\overset{\sim}{\underset{¯}{\alpha}}}} \\ {0.5\left( {\overset{\sim}{c} - {\underset{¯}{\overset{\sim}{\alpha}}}^{2}} \right)} \end{bmatrix}}.}} & \left( {A{.11}} \right) \\ {{\nabla_{\overset{\sim}{\underset{¯}{\alpha}},\underset{¯}{\beta},\lambda}\mathcal{L}} = {\left. \underset{¯}{O}\Rightarrow{{\left( {{E^{*}E} + {\mu R^{*}R}} \right)\underset{¯}{\overset{\sim}{\alpha}}} - {E^{*}V^{*}W\underset{¯}{\beta}}} \right. = {\lambda\overset{\sim}{\underset{¯}{\alpha}}}}} & \left( {A{.12}} \right) \\ {{\underset{¯}{\beta} = {W^{*}V\; E\overset{\sim}{\underset{¯}{\alpha}}}},} & \left( {A{.13}} \right) \\ {{\overset{\sim}{\underset{¯}{\alpha}}}^{2} = {\overset{\sim}{c}.}} & \left( {A{.14}} \right) \end{matrix}$

Combining (A.12), (A.13), we get (E*E+μR*R−E*V*WW*VE){tilde over (α)}=λ{tilde over (α)}.  (A.15)

We can now obtain the value of the objective function, by plugging (A.13) in (A.6), and then using (A.15) and (A.14)

$\begin{matrix} {{{\overset{\sim}{\underset{¯}{\alpha}}}^{*}\underset{\underset{\lambda\overset{\sim}{\underset{¯}{\alpha}}}{︸}}{\left( {{E^{*}E} + {\mu R^{*}R} - {E^{*}V^{*}WW^{*}VE}} \right)\overset{\sim}{\underset{¯}{\alpha}}}} = {{\lambda\underset{\underset{\overset{\sim}{c}}{︸}}{{\overset{\sim}{\underset{¯}{\alpha}}}^{2}}} = {\lambda{\overset{\sim}{c}.}}}} & \left( {A{.16}} \right) \end{matrix}$

Now note that

E * ⁢ E = [ I p 2 ⁢ M O _ O _ * 0 ] , E * ⁢ V * ⁢ W ⁢ W * ⁢ VE = [ V * ⁢ W ⁢ W * ⁢V O _ O _ * 0 ] , and ( A ⁢ .3 ) R * ⁢ R = [ * ⁢ * ⁢ Ψ * ⁢ x ¯ ( * ⁢ Ψ * ⁢ x ¯ ) *  Ψ * ⁢ x ¯  2 ] , ( A ⁢ .4 ) and therefore equation (A.15) is rewritten as

[ μ ⁢ * ⁢ + I - V * ⁢ W ⁢ W * ⁢ V μ ⁢ * ⁢ Ψ * ⁢ x ¯ μ ⁡ ( * ⁢ Ψ * ⁢ x ¯ ) * μ ⁢  Ψ * ⁢ x ¯  2 ] ⁢ α ¯ ~ = λ ⁢ α ¯ ~ . ( A ⁢ .17 )

Since any singular pair of the (symmetric) matrix in (A.17) is a solution, and since we seek to minimize the error (A.16), we pick the solution

${\hat{\overset{\sim}{\underset{¯}{\alpha}}} = {\sqrt{\overset{\sim}{c}}\underset{¯}{v}}},$ where ν is the last singular vector of the matrix in (A.17), with associated (smallest) singular value σ_(ν) (and thus

${\sqrt{\overset{˜}{c}} = {- \frac{1}{e}}},$ where e is the last element in v).

Now recall (A.2) and rewrite (A.17) as

[ μ ⁢ * ⁢ + I - V * ⁢ W ⁢ ⁢ W * ⁢ V μ ⁢ * ⁢ Ψ * ⁢ x ¯ μ ⁡ ( * ⁢ Ψ * ⁢ x ¯ ) * μ ⁢  Ψ * ⁢ x ¯  2 ] ⁡ [ α ^ _ - 1 ] = σ v ⁡ [ α ^ _ - 1 ] . ( A ⁢ .18 )

The top part of equation (A.18) is (μJ*J+I−V*WW*V){circumflex over (α)}−μJ*Ψ*x=σ _(ν) {circumflex over (α)}(A.19) and therefore {circumflex over (α)}=μ[μJ*J+(1−σ_(ν))I−V*WW*V]⁻¹(J*Ψ*x ).  (A.20)

Now, for numerical stability reasons, the computation of the smallest singular value of the matrix in A.17 might be inaccurate (because the last row and the last column in the matrix in A.17 have much higher values compared to μJ*J+I−V*WW*V), so instead of using Ψ*x in optimization problem A.1 we use its normalized version

$\frac{\Psi^{*}\underset{¯}{x}}{{\Psi^{*}\underset{¯}{x}}}.$ So equation A.18 becomes

[ μ ⁢ ⁢ * ⁢ + I - V * ⁢ W ⁢ ⁢ W * ⁢ V μ  Ψ * ⁢ x ¯  ⁢ * ⁢ Ψ * ⁢ x ¯ μ  Ψ * ⁢ x ¯  ⁢ ( * ⁢ Ψ * ⁢ x ¯ ) * μ ⁢ ] ⁡ [ α ^ _ - 1 ] = σ ⁡ [ α ^ _ - 1 ] . ( A ⁢ .21 ) where σ is the smallest singular value the matrix in A.21. Therefore, the corresponding final solution (after scaling back by ∥Ψ*x∥) is {circumflex over (α)}=μ[μJ*J+(1−σ)I−V*WW*V]⁻¹(J*Ψ*x ).  (A.22)

System Requirements for Implementing Algorithm on Laptop

Laptop information:

OS Name Microsoft Windows 10 Home Version 10.0.17134 Build 17134

System Manufacturer Dell Inc.

System Model G3 3579

System Type x64-based PC

Processor Intel® Core™ i7-8750H CPU @ 2.20 GHz, 2208 Mhz, 6 Core(s).

Installed Physical Memory (RAM) 16.0 GB

Matlab information:

MATLAB Version 9.4 (R2018a)

Add-on toolbox: Parallel Computing Toolbox Version 6.12 (R2018a)

-   -   This embodiment of the invention uses the very basic Matlab         package+the parallel computing toolbox to take advantage of the         laptop's 6-core CPU.     -   Matlab is known as a scientific computing programming language.     -   The computations in the algorithm are basic, so it can be done         using other (free) programming platforms such as Anaconda (the         Python distribution) or C or Java, etc.     -   The 100 frame Suzie sequence in the experiment section can be         upsampled using Matlab+the listed laptop in a couple of hours         (or even half an hour if we change some parameters and sacrifice         a bit of quality for speed). Nevertheless, the algorithm's         complexity is considered comparatively low (compared to the norm         in the field of upsampling), but it is still too high for         real-time/low-power applications, which makes optimization for         faster computations potentially very useful. One might also want         to consider other solutions (beyond computational optimization).         For instance, images captured by a low power device (e.g. an         iPhone or a satellite) can be dealt with using cloud computing.     -   As much as ×10-100 speed up can be obtained by converting Matlab         code to C code.     -   The algorithm is parallelizable, so besides writing the         algorithm in C, using a GPU (or the cloud) can considerably         speed up calculations. 

What is claimed is:
 1. A computer implemented method for upsampling low resolution (LR) frames to create high resolution (HR) versions thereof, comprising the steps of: estimating a sequence of said HR frames, from an input sequence of said LR frames, using a structured subspace framework that leverages pairs of LR dictionaries, respectively, wherein one member of each of said pairs of LR dictionaries is directly created, and a second member of each of said pairs is indirectly created, from the input sequence of LR frames to create estimated HR versions of said frames.
 2. The method of claim 1, wherein each pair of said LR dictionaries is comprised of a first LR dictionary that is learned from the input sequence of LR frames, and a second, different-resolution, LR dictionary that is learned from a second sequence of LR frames obtained by decimating an estimate of the HR sequence.
 3. The method of claim 2, wherein the structured subspace framework is based upon estimating at least one of two representations (α and β) of a HR image in terms of two HR bases (V and W), by solving Vα=Wβ where V is the HR basis matrix that spans the HR subspace of all HR images whose polyphase components (PPCs) are spanned by atoms of the first LR dictionary; and W is a second HR basis matrix spanning the HR subspace of all HR images whose PPCs are spanned by the atoms of the second LR dictionary.
 4. The method of claim 3, wherein said HR frames can be estimated by estimating patches thereof using patch-based processing, where the structured subspace framework is applied locally per patch to leverage a pair of local dictionaries learned per patch.
 5. The method of claim 4, wherein the first UR dictionary is learned from local LR image patches extracted from the input sequence of LR frames, whereas the second LR dictionary is learned from local LR patches extracted from the second different-resolution LR sequence obtained by decimating the previous estimate of the HR sequence.
 6. The method of claim 2, wherein the estimation of the HR sequence is repeated.
 7. A computer implemented computational method for estimating a sequence of high-resolution (HR) frames from an input sequence of low-resolution (LR) frames, using a structured subspace framework that leverages pairs of LR dictionaries, comprising the steps of: scanning into a computer memory the input sequence of LR frames; creating a sequence of HR frames using said structured subspace framework by estimating representations of HR images in terms of pairs of HR bases, each of which embeds a different LR dictionary, by solving, per image, the equation: Vα=Wβ where: V is the first HR basis matrix constructed such that it spans any HR image whose polyphase components (PPCs) are spanned by a first LR dictionary Ψ; W is the second HR basis matrix constructed such that it spans any HR image whose PPCs are spanned by another different resolution second LR dictionary Φ; α is the representation of the HR image in terms of V; and, β is the representation of the HR image in terms of W; multiplying the basis matrix V with the representation α, computed from the previous step, to obtain the estimate of the corresponding HR image.
 8. A method as in claim 7, further comprising: dividing a frame, to be estimated, into patches, and applying the estimation process for each individual patch, independently of other patches.
 9. A method as in claim 8, wherein: said patches have size d×d pixels, and overlap, vertically and horizontally, by pq pixels, where: d=rpq, p is the desired upsampling factor, q=p+1, and r is a user-defined factor that determines the size of patches.
 10. A method in accord with claim 9, wherein: per patch, a first LR dictionary is learned from a first set of local LR image patches that are extracted from the input sequence of LR images, whereas a second LR dictionary is learned from a second set of local LR image patches that are extracted from the second different-resolution LR sequence obtained by decimating the previous estimate of the HR sequence, in accord with the steps of: extracting a first set of LR patches from a spatiotemporal neighborhood within the input LR sequence, where said neighborhood is centered at the spatiotemporal location of the LR patch whose HR version is to be estimated, and LR patches extracted from a LR frame, that belongs to said neighborhood, can overlap vertically and horizontally by at most rq−1 pixels; wherein the M patches, from the first set of extracted LR patches, that are most similar to the LR patch whose HR version to be estimated, are used as atoms of the first LR dictionary; extracting a second set of LR patches from a spatiotemporal neighborhood within the second different-resolution LR sequence, where said neighborhood is centered at the spatiotemporal location of the LR patch, in the second LR sequence, that corresponds to the HR patch to be estimated, and LR patches extracted from a LR frame, that belongs to said neighborhood, can overlap vertically and horizontally by at most rp−1 pixels; wherein the N patches, from the second set of extracted LR patches, that are most similar to the LR patch in the second LR sequence that corresponds to the HR patch to be estimated, are used as atoms of the second LR dictionary.
 11. A method as in claim 9, wherein, an estimate of a frame is obtained by: tiling its estimated patches in their respective locations, forming r² different estimates of the same HR frame; and, combining all r² estimates into one single estimate.
 12. The method of claim 11, where the estimated HR frames are decimated by q to create an updated version of the second LR sequence, and the solution is repeated, resulting in updated estimates of the sequence of HR frames until the HR frames stop getting any better in accord with a predetermined criteria defined as when a user-defined number of iteration is exhausted, and where the very first estimate of the HR sequence is an initial guess. 